Approximating bisimilarity for Markov processes

DOI10.1016/J.ENTCS.2013.12.007zbMath1334.68158OpenAlexW2064839890WikidataQ113317929 ScholiaQ113317929MaRDI QIDQ265837

Chunlai Zhou

Publication date: 12 April 2016

Full work available at URL: https://doi.org/10.1016/j.entcs.2013.12.007

zbMATH Keywords

fixed pointMarkov processesevent bisimilarityHennessy-Milner logicstate bisimilarity

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) Logic in computer science (03B70) 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)

Related Items (1)

THE ZHOU ORDINAL OF LABELLED MARKOV PROCESSES OVER SEPARABLE SPACES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lattice properties of congruences for stochastic relations
• Approximating Markov processes through filtration
• Unprovability of the logical characterization of bisimulation
• Stochastic coalgebraic logic
• Approximating labelled Markov processes
• Bisimulation and cocongruence for probabilistic systems
• Approximating and computing behavioural distances in probabilistic transition systems
• Bisimulation for labelled Markov processes
• Stochastic Relations: Congruences, Bisimulations and the Hennessy--Milner Theorem
• Approximating Markov Processes by Averaging

This page was built for publication: Approximating bisimilarity for Markov processes