Bisimulation and Simulation Relations for Markov Chains

DOI10.1016/J.ENTCS.2005.12.078zbMATH Open1316.68085DBLPjournals/entcs/BaierHKW06OpenAlexW2132405487WikidataQ57801770 ScholiaQ57801770MaRDI QIDQ5262953FDOQ5262953

Joost-Pieter Katoen, Christel Baier, Holger Hermanns, Verena Wolf

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

zbMATH Keywords

Markov chaintemporal logic(weak) bisimulation(weak) simulation

Mathematics Subject Classification ID

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?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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.
• 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
• Validation of Stochastic Systems
• Process algebra for performance evaluation
• Extended Markovian Process Algebra
• Probabilistic weak simulation is decidable in polynomial time
• Domain equations for probabilistic processes

Cited In (5)

• Simulation of program execution using popular Markov chains
• Bisimulation is two-way simulation
• Compositional Design of Stochastic Timed Automata
• Title not available (Why is that?)
• Similarity-based minimization of fuzzy tree automata

Recommendations

• Bisimulation for labelled Markov processes 👍 👎
• Approximating bisimilarity for Markov processes 👍 👎
• Bisimulation Metrics for Continuous Markov Decision Processes 👍 👎
• Bisimulations for non-deterministic labelled Markov processes 👍 👎
• Bisimulations and Logical Characterizations on Continuous-Time Markov Decision Processes 👍 👎
• Bisimulation on Markov Processes over Arbitrary Measurable Spaces 👍 👎
• Distribution-based bisimulation for labelled Markov processes 👍 👎
• Bisimilarity of Distributionally Equivalent Markov Transition Systems 👍 👎
• Bisimulation for Markov Decision Processes through Families of Functional Expressions 👍 👎

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)