POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A calculus of mobile processes, I
Information and Computation
The reflexive CHAM and the join-calculus
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
What is a “good” encoding of guarded choice?
Information and Computation - Special issue on EXPRESS 1997
Some Results in the Joint-Calculus
TACS '97 Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software
An Object Calculus for Asynchronous Communication
ECOOP '91 Proceedings of the European Conference on Object-Oriented Programming
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
On the expressive power of polyadic synchronisation in π-calculus
Nordic Journal of Computing
Comparing the expressive power of the synchronous and asynchronous $pi$-calculi
Mathematical Structures in Computer Science
A Distributed Pi-Calculus
On Synchronous and Asynchronous Interaction in Distributed Systems
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Towards a unified approach to encodability and separation results for process calculi
Information and Computation
The Expressive Power of Synchronizations
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
Is it a "good" encoding of mixed choice?
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
On distributability of petri nets
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
| Hi-index | 0.00 |
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 pi-calculus with mixed choice into its fragment with only separate choice, and neither from the asynchronous pi-calculus (without choice) into the join-calculus.