Bisimulation and Simulation Relations for Markov Chains
From MaRDI portal
(Redirected from Publication:5262953)
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)
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
Cites work
- scientific article; zbMATH DE number 1701760 (Why is no real title available?)
- scientific article; zbMATH DE number 149518 (Why is no real title available?)
- scientific article; zbMATH DE number 1927573 (Why is no real title available?)
- scientific article; zbMATH DE number 1759619 (Why is no real title available?)
- scientific article; zbMATH DE number 846904 (Why is no real title available?)
- A logic for reasoning about time and reliability
- Bisimulation for probabilistic transition systems: a coalgebraic approach
- Bisimulation through probabilistic testing
- Branching time and abstraction in bisimulation semantics
- Comparative branching-time semantics for Markov chains
- Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes.
- Deciding bisimilarity and similarity for probabilistic processes.
- Domain equations for probabilistic processes
- Exact and ordinary lumpability in finite Markov chains
- Extended Markovian Process Algebra
- Interactive Markov chains. And the quest for quantified quality
- Optimal state-space lumping in Markov chains
- Probabilistic weak simulation is decidable in polynomial time
- Process algebra for performance evaluation
- Reactive, generative, and stratified models of probabilistic processes
- Validation of Stochastic Systems
Cited in
(18)- scientific article; zbMATH DE number 4166873 (Why is no real title available?)
- Compositional design of stochastic timed automata
- Probabilistic operational correspondence
- On probabilistic alternating simulations
- scientific article; zbMATH DE number 1927572 (Why is no real title available?)
- Stochastic Relations: Congruences, Bisimulations and the Hennessy--Milner Theorem
- Bisimulation equivalence relation and logic preservation for continue time Markov decision process
- Bisimulation as a logical relation
- Bisimulation cuts for structuring Markov transition systems
- A definition scheme for quantitative bisimulation
- scientific article; zbMATH DE number 4115933 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 6987095 (Why is no real title available?)
- 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)
