Skip to main content

Bisimilarity is not Borel


We prove that the relation of bisimilarity between countable labelled transition systems (LTS) is Σ1 1-complete (hence not Borel), by reducing the set of non-well orders over the natural numbers continuously to it.

This has an impact on the theory of probabilistic and non-deterministic processes over uncountable spaces, since logical characterizations of bisimilarity (as, for instance, those based on the unique structure theorem for analytic spaces) require a countable logic whose formulas have measurable semantics. Our reduction shows that such a logic does not exist in the case of image-infinite processes.

Hide All

Partially supported by CONICET, ANPCyT project PICT 2012-1823, SeCyT-UNC project 05/B284, and EU 7FP grant agreement 295261 (MEALS). Part of this work was presented at Dagstuhl Seminar 12411 on Coalgebraic Logics.

Hide All
Blackburn P., Benthem J.V. and Wolter F. (2006). Handbook of Modal Logic, Studies in Logic and Practical Reasoning, volume 3, Elsevier Science Inc., New York, NY, USA.
Bolognesi T. and Brinksma E. (1987). Introduction to the ISO specification language LOTOS. Computer Networks 14 (1) 2559.
Celayes P. (2006). Procesos de Markov Etiquetados sobre Espacios de Borel Estándar, Master's thesis, FaMAF, Universidad Nacional de Córdoba.
Danos V., Desharnais J., Laviolette F. and Panangaden P. (2006). Bisimulation and cocongruence for probabilistic systems. Information and Computation 204 (4) 503523.
D'Argenio P., Wolovick N., Sánchez Terraf P. and Celayes P. (2009). Nondeterministic labeled Markov processes: Bisimulations and logical characterization. In: QEST, IEEE Computer Society 1120.
D'Argenio P.R., Sánchez Terraf P. and Wolovick N. (2012). Bisimulations for non-deterministic labelled Markov processes. Mathematical Structures in Computer Science 22 (1) 4368.
Desharnais J. (1999). Labeled Markov Process, Ph.D. thesis, McGill University.
Desharnais J., Edalat A. and Panangaden P. (2002). Bisimulation for labelled Markov processes. Information and Computation 179 (2) 163193.
Desharnais J., Laviolette F. and Turgeon A. (2011). A logical duality for underspecified probabilistic systems. Information and Computation 209 (5) 850871.
Doberkat E.E. (2005). Stochastic relations: Congruences, bisimulations and the Hennessy–Milner theorem. SIAM Journal on Computing 35 (3) 590626.
Doberkat E.E. (2007a). Kleisli morphisms and randomized congruences for the Giry monad. Journal of Pure and Applied Algebra 211 (3) 638664.
Doberkat E.E. (2007b). Stochastic Relations: Foundations for Markov Transition Systems, Studies in Informatics Series, Chapman & Hall/CRC, Taylor & Francis.
Doberkat E.E. (2009). Stochastic Coalgebraic Logic, Monographs in Theoretical Computer Science, Springer.
Edalat A. (1999). Semi-pullbacks and bisimulation in categories of Markov processes. Mathematical Structures in Computer Science 9 (5) 523543.
Kechris A.S. (1994). Classical Descriptive Set Theory, Graduate Texts in Mathematics, volume 156, Springer-Verlag.
Kechris A.S. (2011). Classical descriptive set theory; corrections and updates. Available at
Kracht M. (1999). Tools and Techniques in Modal Logic, Studies in Logic and the Foundations of Mathematics, Elsevier.
Larsen K.G. and Skou A. (1991). Bisimulation through probabilistic testing. Information and Computation 94 (1) 128.
Moschovakis Y.N. (2009). Descriptive Set Theory, 2nd edition, Mathematical Surveys and Monographs, American Mathematical Society.
Rutten J.J.M.M. (2000). Universal coalgebra: A theory of systems. Theoretical Computer Science 249 (1) 380.
Sánchez Terraf P. (2011). Unprovability of the logical characterization of bisimulation. Information and Computation 209 (7) 10481056.
Scott D. (1964). Invariant Borel sets. Fundamenta Mathematicae 56 (1) 117128.
Srivastava S.M., A Course on Borel Sets, Graduate Texts in Mathematics, volume 180, Springer.
Wolovick N. (2012). Continuous Probability and Nondeterminism in Labeled Transition Systems, Ph.D. thesis, Universidad Nacional de Córdoba.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Mathematical Structures in Computer Science
  • ISSN: 0960-1295
  • EISSN: 1469-8072
  • URL: /core/journals/mathematical-structures-in-computer-science
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Full text views

Total number of HTML views: 0
Total number of PDF views: 22 *
Loading metrics...

Abstract views

Total abstract views: 123 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 23rd January 2018. This data will be updated every 24 hours.