391 search results - page 3 / 79 » Compositionality for Probabilistic Automata |
CONCUR
2009
Springer
14 years 10 days ago
2009
Springer
Abstract. Probabilistic timed automata are an extension of timed automata with discrete probability distributions. In previous work, a probabilistic notion of time divergence for p...
CONCUR
2009
Springer
14 years 10 days ago
2009
Springer
Abstract. Concavely-priced probabilistic timed automata, an extension of probabilistic timed automata, are introduced. In this paper we consider expected reachability, discounted, ...
IRI
2008
IEEE
14 years 5 days ago
2008
IEEE
— We revisit the problem of synthesis of service composition in the context of service oriented architecture from a tree automata perspective. Comparing to existing finite state...
FORMATS
2010
Springer
13 years 3 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...
IPL
2007
13 years 5 months ago
2007
We show that the problem of reaching a state set with probability 1 in probabilisticnondeterministic systems operating in parallel is EXPTIME-complete. We then show that this prob...