Abstract
We show a cancellation property for probabilistic choice. If µ ⊕ ρ and ν ⊕ ρ are branching probabilistic bisimilar, then µ and ν are also branching probabilistic bisimilar. We do this in the setting of a basic process language involving non-deterministic and probabilistic choice and define branching probabilistic bisimilarity on distributions. Despite the fact that the cancellation property is very elegant and concise, we failed to provide a short and natural combinatorial proof. Instead we provide a proof using metric topology. Our major lemma is that every distribution can be unfolded into an equivalent stable distribution, where the topological arguments are required to deal with uncountable branching.
Original language | English |
---|---|
Pages (from-to) | 42-58 |
Number of pages | 17 |
Journal | Electronic Proceedings in Theoretical Computer Science, EPTCS |
Volume | 387 |
DOIs | |
Publication status | Published - 14 Sept 2023 |
Event | Combined 30th International Workshop on Expressiveness in Concurrency and 20th Workshop on Structural Operational Semantic, EXPRESS/SOS 2023 - Antwerp, Belgium Duration: 18 Sept 2023 → 18 Sept 2023 |
Funding
Supported by Royal Society Wolfson Fellowship RSWF\R1\221008
Funders | Funder number |
---|---|
Royal Dutch Chemical Society | RSWF\R1\221008 |