Dynamic Logic
AMAST '00 Proceedings of the 8th International Conference on Algebraic Methodology and Software Technology
Bisimulation for labelled Markov processes
Information and Computation - Special issue: LICS'97
Approximating labelled Markov processes
Information and Computation
Stochastic Relations: Congruences, Bisimulations and the Hennessy--Milner Theorem
SIAM Journal on Computing
Approximating and computing behavioural distances in probabilistic transition systems
Theoretical Computer Science
Approximating Markov Processes by Averaging
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Bisimulation and cocongruence for probabilistic systems
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Stochastic Coalgebraic Logic
Unprovability of the logical characterization of bisimulation
Information and Computation
Approximating Markov processes through filtration
Theoretical Computer Science
| Hi-index | 0.00 |
In this paper we investigate bisimilarity for general Markov processes through the correspondence between sub-@s-algebras and equivalence relations. In particular, we study bisimulations from the perspective of fixed-point theory. Given a Markov process M=, we characterize its state bisimilarity as the greatest fixed point of a composition of two natural set operators between equivalence relations on @W and sub-@s-algebras of @S. Moreover, we employ a Smith-Volterra-Cantor-set-construction to obtain an example to show that state bisimilarity is beyond @w iterations of these two operators alternately from event bisimilarity and hence the composite operator is not continuous. This process of iteration illustrates the gap between event bisimilarity (or logical equivalence) and state bisimilarity, and hence provides insights about the Hennessy-Milner property for general Markov processes. At the end of this paper, we also study approximation of Markov processes related to filtration.