Concurrency and Composition in a Stochastic World
Abstract
We discuss conceptional and foundational aspects of Markov automata [22]. 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.
Domains
Performance [cs.PF]Origin | Files produced by the author(s) |
---|
Loading...