A Cancellation Law for Probabilistic Processes

Rob van Glabbeek
(University of Edinburgh & University of New South Wales)
Jan Friso Groote
(Eindhoven University of Technology)
Erik de Vink
(Eindhoven University of Technology)

We show a cancellation property for probabilistic choice. If distributions mu + rho and nu + rho are branching probabilistic bisimilar, then distributions mu and nu 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.

In Claudio Antares Mezzina and Georgiana Caltais: Proceedings Combined 30th International Workshop on Expressiveness in Concurrency and 20th Workshop on Structural Operational Semantics (EXPRESS/SOS2023), Antwerp, Belgium, 18th September 2023, Electronic Proceedings in Theoretical Computer Science 387, pp. 42–58.
Published: 14th September 2023.

ArXived at: https://dx.doi.org/10.4204/EPTCS.387.5 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org