The Expressive Power of Monotonic Parallel Composition


We show a separation result between on the one hand models of concurrency that contain solutions to the consensus problem, where many identical concurrent processes must reach agreement; and on the other hand models with monotonic parallel composition, where processes always have the possibility to act independently of other processes in their environment. Our definitions and proofs are easy to instantiate in order to obtain particular separation results. We illustrate this point by strengthening several results from the literature, and proving some new ones. Highlights include a separation between unreliable and reliable broadcast π, between the ρ-calculus and cc-pi, and between the full psi-calculi framework and its restriction to monotonic assertion logics.

DOI: 10.1007/978-3-662-49498-1_30

Extracted Key Phrases

1 Figure or Table

Cite this paper

@inproceedings{Pohjola2016TheEP, title={The Expressive Power of Monotonic Parallel Composition}, author={Johannes {\AA}man Pohjola and Joachim Parrow}, booktitle={ESOP}, year={2016} }