512 search results - page 13 / 103 » Automata as Abstractions |
TCS
2010
13 years 3 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 ...
ECSCW
2001
13 years 10 months ago
2001
Abstract. Team automata provide a framework for capturing notions like coordination, colon, and cooperation in distributed systems. They consist of an abstract specification of com...
STACS
2009
Springer
14 years 3 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...
STACS
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We prove that, for any arbitrary finite alphabet and for the uniform distribution over deterministic and accessible automata with n states, the average complexity of Moo...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
The value 1 problem is a decision problem for probabilistic automata on finite words: given a probabilistic automaton A, are there words accepted by A with probability arbitraril...