2016/08/10 by Matias David Lee, Bas Luttik
Computer Science · #cs.LO #cs.PL
paper · pdf · doi:10.4204/eptcs.222.4
published as EPTCS 222, 2016, pp. 45-59 · In Proceedings EXPRESS/SOS 2016, arXiv:1608.02692
arxiv created 2016/08/10 · arxiv updated 2016/08/11
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.