391 search results - page 31 / 79 » Compositionality for Probabilistic Automata |
ENTCS
2006
13 years 8 months ago
2006
Many formalisms use interleaving to model concurrency. To describe some system behaviours appropriately, we need to limit interleaving. For example, in componentbased systems, we ...
FORMATS
2006
Springer
14 years 9 days ago
2006
Springer
Abstract. We show how to transform formulae written in the real-time temporal logic MITL into timed automata that recognize their satisfying models. This compositional construction...
GG
2004
Springer
14 years 2 months ago
2004
Springer
We propose to study two infinite graph transformations that we respectively call bounded and unbounded path transduction. These graph transformations are based on path substitutio...
ACS
2011
13 years 3 months ago
2011
We describe an algebra for composing automata in which the actions have probabilities. We illustrate by showing how to calculate the probability of reaching deadlock in k steps in...
ARTS
1999
Springer
14 years 28 days ago
1999
Springer
Published results show that various models may be obtained by combining parallel composition with probability and with or without non-determinism. In this paper we treat this probl...