Bisimulation and Simulation Relations for Markov Chains
DOI10.1016/J.ENTCS.2005.12.078zbMATH Open1316.68085DBLPjournals/entcs/BaierHKW06OpenAlexW2132405487WikidataQ57801770 ScholiaQ57801770MaRDI QIDQ5262953FDOQ5262953
Authors: Holger Hermanns, Verena Wolf, Christel Baier, Joost-Pieter Katoen 
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
Recommendations
- Bisimulation for labelled Markov processes
- Bisimulation on Markov processes over arbitrary measurable spaces
- Bisimulations for non-deterministic labelled Markov processes
- Distribution-based bisimulation for labelled Markov processes
- Approximating bisimilarity for Markov processes
- Bisimulation for Markov decision processes through families of functional expressions
- Bisimilarity of distributionally equivalent Markov transition systems
- Bisimulations and logical characterizations on continuous-time Markov decision processes
- Bisimulation metrics for continuous Markov decision processes
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Title not available (Why is that?)
- Interactive Markov chains. And the quest for quantified quality
- Bisimulation through probabilistic testing
- A logic for reasoning about time and reliability
- Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes.
- Title not available (Why is that?)
- Exact and ordinary lumpability in finite Markov chains
- Bisimulation for probabilistic transition systems: a coalgebraic approach
- Deciding bisimilarity and similarity for probabilistic processes.
- Branching time and abstraction in bisimulation semantics
- Optimal state-space lumping in Markov chains
- Comparative branching-time semantics for Markov chains
- Reactive, generative, and stratified models of probabilistic processes
- Title not available (Why is that?)
- Validation of Stochastic Systems
- Process algebra for performance evaluation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Extended Markovian Process Algebra
- Probabilistic weak simulation is decidable in polynomial time
- Domain equations for probabilistic processes
Cited In (16)
- Compositional design of stochastic timed automata
- Title not available (Why is that?)
- On probabilistic alternating simulations
- Stochastic Relations: Congruences, Bisimulations and the Hennessy--Milner Theorem
- Title not available (Why is that?)
- Bisimulation equivalence relation and logic preservation for continue time Markov decision process
- Bisimulation as a logical relation
- Bisimulation cuts for structuring Markov transition systems
- Title not available (Why is that?)
- Bisimulation relation for selected types of probabilistic and quantum automata
- Simulation of program execution using popular Markov chains
- Bisimulation is two-way simulation
- Hybrid Systems: Computation and Control
- Title not available (Why is that?)
- Simulation relations and applications in formal methods
- Similarity-based minimization of fuzzy tree automata
This page was built for publication: Bisimulation and Simulation Relations for Markov Chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5262953)
