Concurrency and composition in a stochastic world. (English) Zbl 1287.68132

Gastin, Paul (ed.) et al., CONCUR 2010 – concurrency theory. 21st international conference, CONCUR 2010, Paris, France, August 31 – September 3, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15374-7/pbk). Lecture Notes in Computer Science 6269, 21-39 (2010).
Summary: We discuss conceptional and foundational aspects of Markov automata [the authors, “On probabilistic automata in continuous time”, in: Proceedings of the 25th annual IEEE symposium on logics in computer science, LICS 2010. Los Alamitos: IEEE Computer Society. 342–351 (2010; doi:10.1109/LICS.2010.41)]. 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 detailed 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.
For the entire collection see [Zbl 1194.68036].


68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68Q45 Formal languages and automata
68Q87 Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)
Full Text: DOI Link