Bisimulation cuts for structuring Markov transition systems

DOI10.3233/FI-2016-1452MaRDI QIDQ4589252zbMATH OpenOpenAlexFDO

Authors Ernst-Erich Doberkat

Publication date 9 November 2017

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2016-1452

Mathematics Subject Classification ID

Descriptive set theory (03E15) Galois correspondences, closure operators (in relation to ordered sets) (06A15) Subalgebras, congruence relations (08A30) Applications of universal algebra in computer science (08A70) 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

• Stochastic Relations: Congruences, Bisimulations and the Hennessy--Milner Theorem
• Bisimulation and Simulation Relations for Markov Chains
• Bisimulation for labelled Markov processes
• Bisimulation and cocongruence for probabilistic systems
• Stochastic Relations

This page was built for publication: Bisimulation cuts for structuring Markov transition systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4589252)