2000 character limit reached
Unique Parallel Decomposition for the Pi-calculus (1608.03128v1)
Published 10 Aug 2016 in cs.LO and cs.PL
Abstract: 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.