z-logo
open-access-imgOpen Access
Bisimilarity of Distributionally Equivalent Markov Transition Systems
Author(s) -
Ernst–Erich Doberkat
Publication year - 2008
Publication title -
electronic notes in theoretical computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.242
H-Index - 60
ISSN - 1571-0661
DOI - 10.1016/j.entcs.2008.04.052
Subject(s) - mathematics , morphism , equivalence (formal languages) , logical equivalence , discrete mathematics , markov chain , ergodic theory , pure mathematics , statistics
Markov transition systems for interpreting a simple negation free Hennessy-Milner logic are called distributionally equivalent iff for each formula the probability for its extension in one model is matched probabilistically in the other one. This extends in a natural way the notion of logical equivalence which is defined on the states of a transition system to its subprobability distributions. It is known that logical equivalence is equivalent to bisimilarity, i.e., the existence of a span of Borel maps that act as morphisms. We show that distributional equivalence is equivalent to bisimilarity as well, using a characterization of distributional equivalent transition systems through ergodic morphisms. As an aside, we relate bisimilar transition systems to those systems, for which cospans — taken in the category of measurable maps resp. in the Kleisli category associated with the Giry monad — exist

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom