Unique Parallel Decomposition for the Pi-calculus
Logic in Computer Science
2016-08-11 v1 Programming Languages
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.
Cite
@article{arxiv.1608.03128,
title = {Unique Parallel Decomposition for the Pi-calculus},
author = {Matias David Lee and Bas Luttik},
journal= {arXiv preprint arXiv:1608.03128},
year = {2016}
}
Comments
In Proceedings EXPRESS/SOS 2016, arXiv:1608.02692