No. Title Author Year
1 Near-Optimal Complexity Bounds for Fragments of the Skolem Problem Akshay, S. et al. 2020
2 Classification Among Hidden Markov Models Akshay, S. et al. 2019
3 On Petri Nets with Hierarchical Special Arcs Akshay, S. et al. 2017
4 Towards an Efficient Tree Automata Based Technique for Timed Systems Akshay, S. et al. 2017
5 Analyzing Timed Systems Using Tree Automata Akshay, S. et al. 2016
6 Front Matter, Table of Contents, Preface, Conference Organization, External Reviewers Lal, Akash et al. 2016
7 LIPICs, Volume 65, FSTTCS'16, Complete Volume Lal, Akash et al. 2016
8 On Regularity of Unary Probabilistic Automata Akshay, S. et al. 2016
9 Stochastic Timed Games Revisited Akshay, S. et al. 2016
10 Implementing Realistic Asynchronous Automata Akshay, S. et al. 2013
11 Model checking time-constrained scenario-based specifications Akshay, S. et al. 2010
Current Page :
Number of result pages: 1
Number of documents: 11


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI