Unique Parallel Decomposition for the Pi-calculus

Matias David Lee
(Univ. Lyon, ENS de Lyon, CNRS, UCB Lyon 1, LIP, France.)
Bas Luttik
(Eindhoven University of Technology, The Netherlands.)

A (fragment of a) process algebra satisfies unique parallel decomposition if the definable behaviours admit a unique decomposition into indecomposable parallel components. In this paper we prove that finite processes of the pi-calculus, i.e. processes that perform no infinite executions, satisfy this property modulo strong bisimilarity and weak bisimilarity. Our results are obtained by an application of a general technique for establishing unique parallel decomposition using decomposition orders.

In Daniel Gebler and Kirstin Peters: Proceedings Combined 23rd International Workshop on Expressiveness in Concurrency and 13th Workshop on Structural Operational Semantics (EXPRESS/SOS 2016), Québec City, Canada, 22nd August 2016, Electronic Proceedings in Theoretical Computer Science 222, pp. 45–59.
Published: 9th August 2016.

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