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. © 2012 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Peters, K., & Nestmann, U. (2012). Is it a “good” encoding of mixed choice? In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7213 LNCS, pp. 210–224). https://doi.org/10.1007/978-3-642-28729-9_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
