Bisimilarity of Distributionally Equivalent Markov Transition Systems

DOI10.1016/j.entcs.2008.04.052zbMath1286.68351OpenAlexW2073640081MaRDI QIDQ5415607

Ernst-Erich Doberkat

Publication date: 13 May 2014

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

modal logicconcurrency theoryMarkov transition systemsGiry monadstochastic relations

Mathematics Subject Classification ID

Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Eilenberg-Moore and Kleisli constructions for monads (18C20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stochastic coalgebraic logic: bisimilarity and behavioral equivalence
• Kleisli morphisms and randomized congruences for the Giry monad
• Coalgebraic logic for stochastic right coalgebras
• Nuclear and trace ideals in tensored \(^*\)-categories
• Bisimulation for labelled Markov processes
• Stochastic Relations
• Stochastic Relations: Congruences, Bisimulations and the Hennessy--Milner Theorem

This page was built for publication: Bisimilarity of Distributionally Equivalent Markov Transition Systems