Bisimulations for non-deterministic labelled Markov processes
DOI10.1017/S0960129511000454zbMath1234.68316arXiv1011.3362OpenAlexW2143249843MaRDI 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 processesbisimulationsHennessy-Milner logicinternal non-determinismnon-deterministic labelled Markov processes
Continuous-time Markov processes on general state spaces (60J25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (12)
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
This page was built for publication: Bisimulations for non-deterministic labelled Markov processes