Bisimulations for non-deterministic labelled Markov processes
DOI10.1017/S0960129511000454zbMath1234.68316arXiv1011.3362MaRDI QIDQ3225737
Pedro Sánchez Terraf, Nicolás Wolovick, Pedro R. D'Argenio
Publication date: 22 March 2012
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1011.3362
Markov processes; bisimulations; Hennessy-Milner logic; internal non-determinism; non-deterministic labelled Markov processes
60J25: Continuous-time Markov processes on general state spaces
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68Q87: Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Bisimulation through probabilistic testing
- Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes.
- Bisimulation and cocongruence for probabilistic systems
- Bisimulation for labelled Markov processes
- A theory of stochastic systems. II: Process algebra
- Logical Characterizations of Bisimulations for Discrete Probabilistic Systems