Real and complex analysis, 3rd ed.
Real and complex analysis, 3rd ed.
Bisimulation through probabilistic testing
Information and Computation
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Bisimulation for labelled Markov processes
Information and Computation - Special issue: LICS'97
Semi-pullbacks and bisimulation in categories of Markov processes
Mathematical Structures in Computer Science
Bisimulation and cocongruence for probabilistic systems
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Semi-pullbacks and bisimulations in categories of stochastic relations
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Approximating Bisimilarity for Markov Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
We quickly review labelled Markov processes (LMP) and provide a counterexample showing that in general measurable spaces, event bisimilarity and state bisimilarity differ in LMP. This shows that the Hennessy-Milner logic proposed by Desharnais does not characterize state bisimulation in non-analytic measurable spaces. Furthermore we show that, under current foundations of Mathematics, such logical characterization is unprovable for spaces that are projections of a coanalytic set. Underlying this construction there is a proof that stationary Markov processes over general measurable spaces do not have semi-pullbacks.