A Spectrum of Approximate Probabilistic Bisimulations
Publikation: Beitrag in Buch/Konferenzbericht/Sammelband/Gutachten › Beitrag in Konferenzband › Beigetragen › Begutachtung
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
Originalsprache | Englisch |
---|---|
Titel | 35th 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 |
Publikationsstatus | Veröffentlicht - 29 Aug. 2024 |
Peer-Review-Status | Ja |
Publikationsreihe
Reihe | Leibniz International Proceedings in Informatics, LIPIcs |
---|---|
Band | 311 |
ISSN | 1868-8969 |
Konferenz
Titel | International Conference on Concurrency Theory |
---|---|
Kurztitel | CONCUR 2024 |
Veranstaltungsnummer | 35 |
Dauer | 9 - 13 September 2024 |
Webseite | |
Bekanntheitsgrad | Internationale Veranstaltung |
Ort | Best Western Plus Village Park Inn |
Stadt | Calgary |
Land | Kanada |
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 |