A Spectrum of Approximate Probabilistic Bisimulations

Publikation: Beitrag in Buch/Konferenzbericht/Sammelband/GutachtenBeitrag in KonferenzbandBeigetragenBegutachtung

Beitragende

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.

Details

OriginalspracheEnglisch
Titel35th International Conference on Concurrency Theory (CONCUR 2024)
Herausgeber (Verlag)Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (elektronisch)978-3-95977-339-3
PublikationsstatusVeröffentlicht - 29 Aug. 2024
Peer-Review-StatusJa

Publikationsreihe

ReiheLeibniz International Proceedings in Informatics, LIPIcs
Band311
ISSN1868-8969

Konferenz

TitelInternational Conference on Concurrency Theory
KurztitelCONCUR 2024
Veranstaltungsnummer35
Dauer9 - 13 September 2024
Webseite
BekanntheitsgradInternationale Veranstaltung
OrtBest Western Plus Village Park Inn
StadtCalgary
LandKanada

Externe IDs

Scopus 85203497328
ORCID /0000-0002-5321-9343/work/173985295
ORCID /0000-0003-4829-0476/work/173987796
ORCID /0009-0008-4461-0667/work/173989272

Schlagworte