Approximating bisimilarity for Markov processes
From MaRDI portal
Logic in computer science (03B70) 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)
Recommendations
Cites work
- Approximating and computing behavioural distances in probabilistic transition systems
- Approximating labelled Markov processes
- Approximating Markov Processes by Averaging
- Approximating Markov processes through filtration
- Bisimulation and cocongruence for probabilistic systems
- Bisimulation for labelled Markov processes
- scientific article; zbMATH DE number 1696897 (Why is no real title available?)
- scientific article; zbMATH DE number 1556014 (Why is no real title available?)
- scientific article; zbMATH DE number 765034 (Why is no real title available?)
- Lattice properties of congruences for stochastic relations
- Measure theory. Vol. I and II
- Stochastic coalgebraic logic
- Stochastic Relations: Congruences, Bisimulations and the Hennessy--Milner Theorem
- Unprovability of the logical characterization of bisimulation
Cited in
(6)- Approximating Markov processes through filtration
- scientific article; zbMATH DE number 6987095 (Why is no real title available?)
- Bisimulation and Simulation Relations for Markov Chains
- Deciding probabilistic bisimilarity distance one for labelled Markov chains
- Explainability of probabilistic bisimilarity distances for labelled Markov chains
- THE ZHOU ORDINAL OF LABELLED MARKOV PROCESSES OVER SEPARABLE SPACES
This page was built for publication: Approximating bisimilarity for Markov processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q265837)