Rooted branching bisimulation as a congruence for probabilistic transition systems
We propose a probabilistic transition system specification format, referred to as probabilistic RBB safe, for which rooted branching bisimulation is a congruence. The congruence theorem is based on the approach of Fokkink for the qualitative case. For this to work, the theory of transition system sp...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Open Publishing Association
2015-09-01
|
| Series: | Electronic Proceedings in Theoretical Computer Science |
| Online Access: | http://arxiv.org/pdf/1509.08564v1 |
| _version_ | 1818586090551902208 |
|---|---|
| author | Matias D. Lee Erik P. de Vink |
| author_facet | Matias D. Lee Erik P. de Vink |
| author_sort | Matias D. Lee |
| collection | DOAJ |
| description | We propose a probabilistic transition system specification format, referred to as probabilistic RBB safe, for which rooted branching bisimulation is a congruence. The congruence theorem is based on the approach of Fokkink for the qualitative case. For this to work, the theory of transition system specifications in the setting of labeled transition systems needs to be extended to deal with probability distributions, both syntactically and semantically. We provide a scheduler-free characterization of probabilistic branching bisimulation as adapted from work of Andova et al. for the alternating model. Counter examples are given to justify the various conditions required by the format. |
| first_indexed | 2024-12-16T08:47:26Z |
| format | Article |
| id | doaj.art-934f3d5482784bbd8ab989d03f540d37 |
| institution | Directory Open Access Journal |
| issn | 2075-2180 |
| language | English |
| last_indexed | 2024-12-16T08:47:26Z |
| publishDate | 2015-09-01 |
| publisher | Open Publishing Association |
| record_format | Article |
| series | Electronic Proceedings in Theoretical Computer Science |
| spelling | doaj.art-934f3d5482784bbd8ab989d03f540d372022-12-21T22:37:34ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802015-09-01194Proc. QAPL 2015799410.4204/EPTCS.194.6:2aRooted branching bisimulation as a congruence for probabilistic transition systemsMatias D. Lee0Erik P. de Vink1 FaMAF, UNC-CONICET, Cordoba TU/e, Eindhoven We propose a probabilistic transition system specification format, referred to as probabilistic RBB safe, for which rooted branching bisimulation is a congruence. The congruence theorem is based on the approach of Fokkink for the qualitative case. For this to work, the theory of transition system specifications in the setting of labeled transition systems needs to be extended to deal with probability distributions, both syntactically and semantically. We provide a scheduler-free characterization of probabilistic branching bisimulation as adapted from work of Andova et al. for the alternating model. Counter examples are given to justify the various conditions required by the format.http://arxiv.org/pdf/1509.08564v1 |
| spellingShingle | Matias D. Lee Erik P. de Vink Rooted branching bisimulation as a congruence for probabilistic transition systems Electronic Proceedings in Theoretical Computer Science |
| title | Rooted branching bisimulation as a congruence for probabilistic transition systems |
| title_full | Rooted branching bisimulation as a congruence for probabilistic transition systems |
| title_fullStr | Rooted branching bisimulation as a congruence for probabilistic transition systems |
| title_full_unstemmed | Rooted branching bisimulation as a congruence for probabilistic transition systems |
| title_short | Rooted branching bisimulation as a congruence for probabilistic transition systems |
| title_sort | rooted branching bisimulation as a congruence for probabilistic transition systems |
| url | http://arxiv.org/pdf/1509.08564v1 |
| work_keys_str_mv | AT matiasdlee rootedbranchingbisimulationasacongruenceforprobabilistictransitionsystems AT erikpdevink rootedbranchingbisimulationasacongruenceforprobabilistictransitionsystems |