Inproceedings3621349134: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Johannes Lehmann (Diskussion | Beiträge) (Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Timm |ErsterAutorNachname=Spork |FurtherAuthors=Christel Baier; Joost-Pieter Katoen; Jakob Piribauer; Tim Quatmann}} {{Inproceedings |Editor=Rupak Majumdar and Alexandra Silva |Title=A Spectrum of Approximate Probabilistic Bisimulations |Booktitle=35th International Conference on Concurrency Theory, CONCUR 2024, September 9-13, 2024, Calgary, Canada |Series=LIPIcs |Volume=311 |Page…“) |
Timm Spork (Diskussion | Beiträge) Keine Bearbeitungszusammenfassung |
||
Zeile 2: | Zeile 2: | ||
|ErsterAutorVorname=Timm | |ErsterAutorVorname=Timm | ||
|ErsterAutorNachname=Spork | |ErsterAutorNachname=Spork | ||
|FurtherAuthors=Christel Baier; Joost-Pieter Katoen; Jakob Piribauer; Tim Quatmann}} | |FurtherAuthors=Christel Baier; Joost-Pieter Katoen; Jakob Piribauer; Tim Quatmann | ||
}} | |||
{{Inproceedings | {{Inproceedings | ||
|Referiert=0 | |||
|Title=A Spectrum of Approximate Probabilistic Bisimulations | |||
|To appear=0 | |||
|Year=2024 | |||
|Month=August | |||
|Booktitle=35th International Conference on Concurrency Theory, CONCUR 2024, September 9-13, 2024, Calgary, Canada | |||
|Pages=37:1--37:19 | |||
|Publisher=Schloss Dagstuhl - Leibniz-Zentrum für Informatik | |||
|Editor=Rupak Majumdar and Alexandra Silva | |Editor=Rupak Majumdar and Alexandra Silva | ||
|Series=LIPIcs | |Series=LIPIcs | ||
|Volume=311 | |Volume=311 | ||
}} | }} | ||
{{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. | |||
|Download=A spectrum of approximate probabilistic bisimulations.pdf | |||
|DOI Name=10.4230/LIPICS.CONCUR.2024.37 | |DOI Name=10.4230/LIPICS.CONCUR.2024.37 | ||
| | |Projekt=CPEC, CeTI | ||
|Forschungsgruppe=Verifikation und formale quantitative Analyse | |Forschungsgruppe=Verifikation und formale quantitative Analyse | ||
}} | }} |
Version vom 5. März 2025, 14:19 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: Verifikation und formale quantitative Analyse„Verifikation und formale quantitative Analyse“ befindet sich nicht in der Liste (Computational Logic, Automatentheorie, Wissensverarbeitung, Knowledge-Based Systems, Knowledge Systems, Wissensbasierte Systeme, Logische Programmierung und Argumentation, Algebra und Diskrete Strukturen, Knowledge-aware Artificial Intelligence, Algebraische und logische Grundlagen der Informatik) zulässiger Werte für das Attribut „Forschungsgruppe“.Algebraic 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}
}