A Spectrum of Approximate Probabilistic Bisimulations

Timm Spork, Christel Baier, Joost Pieter Katoen, Jakob Piribauer, Tim Quatmann

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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 ε-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 ε-bisimulation.

Original languageEnglish
Title of host publication35th International Conference on Concurrency Theory, CONCUR 2024
EditorsRupak Majumdar, Alexandra Silva
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959773393
DOIs
StatePublished - Sep 2024
Externally publishedYes
Event35th International Conference on Concurrency Theory, CONCUR 2024 - Calgary, Canada
Duration: 9 Sep 202413 Sep 2024

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume311
ISSN (Print)1868-8969

Conference

Conference35th International Conference on Concurrency Theory, CONCUR 2024
Country/TerritoryCanada
CityCalgary
Period9/09/2413/09/24

Keywords

  • Abstraction
  • Approximate bisimulation
  • Markov chains
  • Model checking

Fingerprint

Dive into the research topics of 'A Spectrum of Approximate Probabilistic Bisimulations'. Together they form a unique fingerprint.

Cite this