Inproceedings3621349134: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Timm Spork (Diskussion | Beiträge) Keine Bearbeitungszusammenfassung |
Johannes Lehmann (Diskussion | Beiträge) K (Textersetzung - „Verifikation und formale quantitative Analyse“ durch „Algebraische und logische Grundlagen der Informatik“) |
||
| (Eine dazwischenliegende Version von einem anderen Benutzer wird nicht angezeigt) | |||
| Zeile 19: | Zeile 19: | ||
{{Publikation Details | {{Publikation Details | ||
|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. | |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. | ||
|Download= | |Download=LIPIcs.CONCUR.2024.37.pdf | ||
|DOI Name=10.4230/LIPICS.CONCUR.2024.37 | |DOI Name=10.4230/LIPICS.CONCUR.2024.37 | ||
|Projekt=CPEC, CeTI | |Projekt=CPEC, CeTI | ||
|Forschungsgruppe= | |Forschungsgruppe=Algebraische und logische Grundlagen der Informatik | ||
}} | }} | ||
Aktuelle Version vom 5. März 2025, 15:44 Uhr
A Spectrum of Approximate Probabilistic Bisimulations
Timm SporkTimm Spork, Christel BaierChristel Baier, Joost-Pieter KatoenJoost-Pieter Katoen, Jakob PiribauerJakob Piribauer, Tim QuatmannTim Quatmann
Timm Spork, Christel Baier, Joost-Pieter Katoen, Jakob Piribauer, Tim Quatmann
A Spectrum of Approximate Probabilistic Bisimulations
In Rupak Majumdar and Alexandra Silva, eds., 35th International Conference on Concurrency Theory, CONCUR 2024, September 9-13, 2024, Calgary, Canada, volume 311 of LIPIcs, 37:1--37:19, August 2024. Schloss Dagstuhl - Leibniz-Zentrum für Informatik
A Spectrum of Approximate Probabilistic Bisimulations
In Rupak Majumdar and Alexandra Silva, eds., 35th International Conference on Concurrency Theory, CONCUR 2024, September 9-13, 2024, Calgary, Canada, volume 311 of LIPIcs, 37:1--37:19, August 2024. Schloss Dagstuhl - Leibniz-Zentrum für Informatik
- KurzfassungAbstract
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. - Projekt:Project: CPEC, CeTI
- Forschungsgruppe:Research Group: Algebraische und logische Grundlagen der InformatikAlgebraic and Logical Foundations of Computer Science
@inproceedings{SBKPQ2024,
author = {Timm Spork and Christel Baier and Joost-Pieter Katoen and Jakob
Piribauer and Tim Quatmann},
title = {A Spectrum of Approximate Probabilistic Bisimulations},
editor = {Rupak Majumdar and Alexandra Silva},
booktitle = {35th International Conference on Concurrency Theory, {CONCUR}
2024, September 9-13, 2024, Calgary, Canada},
series = {LIPIcs},
volume = {311},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
month = {August},
pages = {37:1--37:19},
doi = {10.4230/LIPICS.CONCUR.2024.37}
}
