What is a “good” encoding of guarded choice?
Information and Computation - Special issue on EXPRESS 1997
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
An Object Calculus for Asynchronous Communication
ECOOP '91 Proceedings of the European Conference on Object-Oriented 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
Concurrent and Located Synchronizations in π-Calculus
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Towards a Unified Approach to Encodability and Separation Results for Process Calculi
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Towards a unified approach to encodability and separation results for process calculi
Information and Computation
On distributability in process calculi
ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems
| Hi-index | 0.00 |
Mixed choice is a widely-used primitive in process calculi. It is interesting, as it allows to break symmetries in distributed process networks. We present an encoding of mixed choice in the context of the π-calculus and investigate to what extent it can be considered "good". As a crucial novelty, we introduce a suitable criterion to measure whether the degree of distribution in process networks is preserved.