On Distributability in Process Calculi [chapter]

Kirstin Peters, Uwe Nestmann, Ursula Goltz
2013 Lecture Notes in Computer Science  
We present a novel approach to compare process calculi and their synchronisation mechanisms by using synchronisation patterns and explicitly considering the degree of distributability. For this, we propose a new quality criterion that (1) measures the preservation of distributability and (2) allows us to derive two synchronisation patterns that separate several variants of pi-like calculi. Precisely, we prove that there is no good and distributability-preserving encoding from the synchronous
more » ... calculus with mixed choice into its fragment with only separate choice, and neither from the asynchronous pi-calculus (without choice) into the join-calculus.
doi:10.1007/978-3-642-37036-6_18 fatcat:hdzudrm3vbfbhm4zh3pdzpknpu