Inproceedings25006817: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Johannes Lehmann (Diskussion | Beiträge) (Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Christel |ErsterAutorNachname=Baier |FurtherAuthors=Mariëlle Stoelinga}} {{Inproceedings |Booktitle=3rd International Conference on Foundations of Software Science and Computation Structures (FoSSaCS) |Pages=1--16 |Publisher=Springer |Series=Lecture Notes in Computer Science |Title=Norm Functions for Probabilistic Bisimulations with Delays |Volume=1784 |Year=2000 }} {{Publikation Details |DOI N…“) |
Johannes Lehmann (Diskussion | Beiträge) K (Textersetzung - „Verifikation und formale quantitative Analyse“ durch „Algebraische und logische Grundlagen der Informatik“) |
||
| Zeile 15: | Zeile 15: | ||
|DOI Name=10.1007/3-540-46432-8_1 | |DOI Name=10.1007/3-540-46432-8_1 | ||
|Abstract=We consider action-labelled systems with non-deterministic and probabilistic choice. Using the concept of norm functions [17], we introduce two types of bisimulations (called (strict) normed bisimulation equivalence) that allow for delays when simulating a transition and are strictly between strong and weak bisimulation equivalence à la [26,36,37]. Using a suitable modification of the prominent splitter/partitioning technique [25,30], we present polynomial-time algorithms that constructs the quotient space of the (strict) normed bisimulation equivalence classes. | |Abstract=We consider action-labelled systems with non-deterministic and probabilistic choice. Using the concept of norm functions [17], we introduce two types of bisimulations (called (strict) normed bisimulation equivalence) that allow for delays when simulating a transition and are strictly between strong and weak bisimulation equivalence à la [26,36,37]. Using a suitable modification of the prominent splitter/partitioning technique [25,30], we present polynomial-time algorithms that constructs the quotient space of the (strict) normed bisimulation equivalence classes. | ||
|Forschungsgruppe= | |Forschungsgruppe=Algebraische und logische Grundlagen der Informatik | ||
}} | }} | ||
Aktuelle Version vom 5. März 2025, 14:43 Uhr
Norm Functions for Probabilistic Bisimulations with Delays
Christel BaierChristel Baier, Mariëlle StoelingaMariëlle Stoelinga
Christel Baier, Mariëlle Stoelinga
Norm Functions for Probabilistic Bisimulations with Delays
3rd International Conference on Foundations of Software Science and Computation Structures (FoSSaCS), volume 1784 of Lecture Notes in Computer Science, 1--16, 2000. Springer
Norm Functions for Probabilistic Bisimulations with Delays
3rd International Conference on Foundations of Software Science and Computation Structures (FoSSaCS), volume 1784 of Lecture Notes in Computer Science, 1--16, 2000. Springer
- KurzfassungAbstract
We consider action-labelled systems with non-deterministic and probabilistic choice. Using the concept of norm functions [17], we introduce two types of bisimulations (called (strict) normed bisimulation equivalence) that allow for delays when simulating a transition and are strictly between strong and weak bisimulation equivalence à la [26,36,37]. Using a suitable modification of the prominent splitter/partitioning technique [25,30], we present polynomial-time algorithms that constructs the quotient space of the (strict) normed bisimulation equivalence classes. - Forschungsgruppe:Research Group: Algebraische und logische Grundlagen der InformatikAlgebraic and Logical Foundations of Computer Science
@inproceedings{BS2000,
author = {Christel Baier and Mari{\"{e}}lle Stoelinga},
title = {Norm Functions for Probabilistic Bisimulations with Delays},
booktitle = {3rd International Conference on Foundations of Software Science
and Computation Structures (FoSSaCS)},
series = {Lecture Notes in Computer Science},
volume = {1784},
publisher = {Springer},
year = {2000},
pages = {1--16},
doi = {10.1007/3-540-46432-8_1}
}
