A Spectrum of Approximate Probabilistic Bisimulations
Research output: Contribution to book/Conference proceedings/Anthology/Report › Conference contribution › Contributed › peer-review
Contributors
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.
Details
Original language | English |
---|---|
Title of host publication | 35th International Conference on Concurrency Theory (CONCUR 2024) |
Editors | Rupak Majumdar, Alexandra Silva |
Publisher | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing |
ISBN (electronic) | 978-3-95977-339-3 |
Publication status | Published - 29 Aug 2024 |
Peer-reviewed | Yes |
Publication series
Series | Leibniz International Proceedings in Informatics, LIPIcs |
---|---|
Volume | 311 |
ISSN | 1868-8969 |
Conference
Title | International Conference on Concurrency Theory |
---|---|
Abbreviated title | CONCUR 2024 |
Conference number | 35 |
Duration | 9 - 13 September 2024 |
Website | |
Degree of recognition | International event |
Location | Best Western Plus Village Park Inn |
City | Calgary |
Country | Canada |
External IDs
Scopus | 85203497328 |
---|---|
ORCID | /0000-0002-5321-9343/work/173985295 |
ORCID | /0000-0003-4829-0476/work/173987796 |
ORCID | /0009-0008-4461-0667/work/173989272 |
Keywords
ASJC Scopus subject areas
Keywords
- Abstraction, Approximate bisimulation, Markov chains, Model checking