Abstract
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.
Supported by the DFG (German Research Foundation), grant NE-1505/2-1.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Boudol, G.: Asynchrony and the π-calculus (note). Note, INRIA (May 1992)
Carbone, M., Maffeis, S.: On the Expressive Power of Polyadic Synchronisation in π-Calculus. Nordic Journal of Computing 10, 1–29 (2003)
Gorla, D.: Towards a Unified Approach to Encodability and Separation Results for Process Calculi. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol. 5201, pp. 492–507. Springer, Heidelberg (2008)
Gorla, D.: Towards a Unified Approach to Encodability and Separation Results for Process Calculi. Information and Computation 208(9), 1031–1053 (2010)
Honda, K., Tokoro, M.: An Object Calculus for Asynchronous Communication. In: America, P. (ed.) ECOOP 1991. LNCS, vol. 512, pp. 133–147. Springer, Heidelberg (1991)
Lanese, I.: Concurrent and Located Synchronizations in π-Calculus. In: van Leeuwen, J., Italiano, G.F., van der Hoek, W., Meinel, C., Sack, H., Plášil, F. (eds.) SOFSEM 2007. LNCS, vol. 4362, pp. 388–399. Springer, Heidelberg (2007)
Nestmann, U.: What is a ”Good” Encoding of Guarded Choice? Information and Computation 156(1-2), 287–319 (2000)
Palamidessi, C.: Comparing the Expressive Power of the Synchronous and the Asynchronous π-calculi. Mathematical Structures in Computer Science 13(5), 685–719 (2003)
Peters, K., Nestmann, U.: Breaking Symmetries. In: Fröschle, S.B., Valencia, F.D. (eds.) EXPRESS. EPTCS, vol. 41, pp. 136–150 (2010)
Peters, K., Nestmann, U.: Is it a ”Good” Encoding of Mixed Choice? (Technical Report). Technical Report, TU Berlin, Germany (January 2012), http://arxiv.org/corr/home
Peters, K., Schicke-Uffmann, J.-W., Nestmann, U.: Synchrony vs Causality in the Asynchronous Pi-Calculus. In: Luttik, B., Valencia, F.D. (eds.) EXPRESS. EPTCS, vol. 64, pp. 89–103 (2011)
Sangiorgi, D., Walker, D.: The π-calculus: A Theory of Mobile Processes. Cambridge University Press, New York (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Peters, K., Nestmann, U. (2012). Is It a “Good” Encoding of Mixed Choice?. In: Birkedal, L. (eds) Foundations of Software Science and Computational Structures. FoSSaCS 2012. Lecture Notes in Computer Science, vol 7213. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28729-9_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-28729-9_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28728-2
Online ISBN: 978-3-642-28729-9
eBook Packages: Computer ScienceComputer Science (R0)