Concurrency and Composition in a Stochastic World
In Concurrency Theory, 21th International Conference (CONCUR)
, pages 21-39, Springer
, Lecture Notes in Computer Science 6269, 2010.
Downloads: pdf, bibURL: http://dx.doi.org/10.1007/978-3-642-15375-4_3
Abstract. We discuss conceptional and foundational aspects of Markov automata . We place this model in the context of continuous- and discrete-time Markov chains, probabilistic automata and interactive Markov chains, and provide insight into the parallel execution of such models. We further give a detailled account of the concept of relations on distributions, and discuss how this can generalise known notions of weak simulation and bisimulation, such as to fuse sequences of internal transitions.