396 search results - page 6 / 80 » Factor Automata of Automata and Applications |
FORMATS
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Probabilistic timed automata are an extension of timed automata with discrete probability distributions. Simulation and bisimulation relations are widely-studied in the c...
TCS
2010
13 years 2 months ago
2010
We are interested in describing timed systems that exhibit probabilistic behaviour. To this purpose, we consider a model of Probabilistic Timed Automata and introduce a concept of ...
STACS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. This paper solves the unambiguity and the sequentiality problem for polynomially ambiguous min-plus automata. This result is proved through a decidable algebraic characte...
IJCSA
2007
13 years 7 months ago
2007
Timed Concurrent State Machines are an application of Alur’s Timed Automata concept to coincidence-based (rather than interleaving) CSM modeling technique. TCSM support the idea...
FMCO
2006
Springer
13 years 11 months ago
2006
Springer
In this paper, we give an overview on some algorithms for learning automata. Starting with Biermann's and Angluin's algorithms, we describe some of the extensions caterin...