English

A Spectrum of Approximate Probabilistic Bisimulations

Logic in Computer Science 2024-07-11 v1

Abstract

This paper studies various notions of approximate probabilistic bisimulation on labeled Markov chains (LMCs). We introduce approximate versions of weak and branching bisimulation, as well as a notion of ε\varepsilon-perturbed bisimulation that relates LMCs that can be made (exactly) probabilistically bisimilar by small perturbations of their transition probabilities. We explore how the notions interrelate and establish their connections to other well-known notions like ε\varepsilon-bisimulation.

Keywords

Cite

@article{arxiv.2407.07584,
  title  = {A Spectrum of Approximate Probabilistic Bisimulations},
  author = {Timm Spork and Christel Baier and Joost-Pieter Katoen and Jakob Piribauer and Tim Quatmann},
  journal= {arXiv preprint arXiv:2407.07584},
  year   = {2024}
}

Comments

Full version of a paper accepted for publication at CONCUR 2024

R2 v1 2026-06-28T17:35:35.383Z