A classification of bisimilarities for general Markov decision processes
From MaRDI portal
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)
Cites work
- A final coalgebra theorem
- A theory for the semantics of stochastic and non-deterministic continuous systems
- Bisimulation and cocongruence for probabilistic systems
- Bisimulation for labelled Markov processes
- Bisimulation for probabilistic transition systems: a coalgebraic approach
- Bisimulation on Markov processes over arbitrary measurable spaces
- Bisimulations for non-deterministic labelled Markov processes
- Expressiveness of probabilistic modal logics: a gradual approach
- scientific article; zbMATH DE number 3764843 (Why is no real title available?)
- scientific article; zbMATH DE number 7350769 (Why is no real title available?)
- Labelled Markov processes.
- Semi-pullbacks and bisimulation in categories of Markov processes
- Semi-pullbacks for stochastic relations over analytic spaces
- Stochastic non-determinism and effectivity functions
- Stochastic Relations: Congruences, Bisimulations and the Hennessy--Milner Theorem
- THE ZHOU ORDINAL OF LABELLED MARKOV PROCESSES OVER SEPARABLE SPACES
- Universal coalgebra: A theory of systems
- Unprovability of the logical characterization of bisimulation
This page was built for publication: A classification of bisimilarities for general Markov decision processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6993442)
