391 search results - page 2 / 79 » Compositionality for Probabilistic Automata |
CONCUR
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. Polynomially accurate simulations [19] are relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation len...
ICTAC
2004
Springer
14 years 4 months ago
2004
Springer
A switched probabilistic I/O automaton is a special kind of probabilistic I/O automaton (PIOA), enriched with an explicit mechanism to exchange control with its environment. Every ...
SIGSOFT
2009
ACM
14 years 11 months ago
2009
ACM
System specifications have long been expressed through automata-based languages, enabling verification techniques such as model checking. These verification techniques can assess ...
TACAS
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. We present a compositional verification technique for systems that exhibit both probabilistic and nondeterministic behaviour. We adopt an assume-guarantee approach to ver...
FM
2003
Springer
14 years 4 months ago
2003
Springer
A team automaton is said to satisfy compositionality if its behaviour can be described in terms of the behaviour of its constituting component automata. As an initial investigation...