Bisimulation and Simulation Relations for Markov Chains
DOI10.1016/j.entcs.2005.12.078zbMath1316.68085DBLPjournals/entcs/BaierHKW06OpenAlexW2132405487WikidataQ57801770 ScholiaQ57801770MaRDI QIDQ5262953
Holger Hermanns, Verena Wolf, Joost-Pieter Katoen, Christel Baier
Publication date: 10 July 2015
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2005.12.078
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) 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 (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Interactive Markov chains. And the quest for quantified quality
- Optimal state-space lumping in Markov chains
- Probabilistic weak simulation is decidable in polynomial time
- Bisimulation through probabilistic testing
- A logic for reasoning about time and reliability
- Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes.
- Reactive, generative, and stratified models of probabilistic processes
- Deciding bisimilarity and similarity for probabilistic processes.
- Comparative branching-time semantics for Markov chains
- Domain equations for probabilistic processes
- Exact and ordinary lumpability in finite Markov chains
- Branching time and abstraction in bisimulation semantics
- Bisimulation for probabilistic transition systems: A coalgebraic approach
- Validation of Stochastic Systems
- Process algebra for performance evaluation
- Extended Markovian Process Algebra
This page was built for publication: Bisimulation and Simulation Relations for Markov Chains