Abstract

The -calculus with synchronous output and mixed-guarded choices is strictly more expressive than the -calculus with asynchronous output and no choice. As a corollary, Palamidessi recently proved that there is no fully compositional encoding from the former into the latter that preserves divergence-freedom and symmetries. This paper shows

Citations

267	The Polyadic ?-calculus: A Tutorial - Milner - 1993
238	Expressing Mobility in Process Algebras: First-Order and HigerOrder Paradigms - Sangiorgi - 1992
231	The reflexive chemical abstract machine and the join-calculus - Fournet, Gonthier - 1996
229	Typing and subtyping for mobile processes - Pierce, Sangiorgi - 1996
213	CML: A Higher-Order Concurrent Language - Reppy - 1991
192	D.: Barbed bisimulation - Milner, Sangiorgi - 1992
191	A New Solution of Dijkstra's Concurrent Programming Problem - Lamport - 1974
178	Another advantage of free choice: completely asynchronous agreement protocols - Ben-Or - 1983
150	D.: A Calculus of Mobile - Milner, Parrow, et al. - 1992
138	Comparing the expressive power of the synchronous and asynchronous π-calculi - Palamidessi - 2003
113	An asynchronous model of locality, failure, and process mobility - Amadio - 1997
87	Decoding Choice Encodings - Nestmann, Pierce - 2000
71	The advantages of free choice: a symmetric and fully distributed solution for the dining philosophers problem”, A classical mind: essays in honour of - Rabin, Lehmann - 1994
70	A partially deadlock-free type process calculus. Pages 128–139 of - Kobayashi - 1997
70	A Calculus of - Milner, Parrow, et al. - 1992
66	On bisimulations for the asynchronous -calculus - Amadio, Castellani, et al. - 1996
65	On asynchronous communication semantics - Honda, Tokoro - 1992
60	An Eciency Preorder for Processes - Arun-Kumar, Hennessy
56	Graph types for monadic mobile processes - Yoshida - 1996
53	A hierarchy of equivalences for asynchronous calculi - Fournet, Gonthier
53	The name discipline of uniform receptiveness - Sangiorgi - 1999
45	A Facile tutorial - Thomsen, Leth, et al. - 1996
42	Asynchrony and the -calculus (note). Rapport de Recherche 1702 - Boudol - 1992
35	An effective implementation for the generalized input-output construct of csp - Buckley, Silberschatz - 1983
35	On the π-calculus and linear logic - Bellin, Scott - 1994
29	On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes - Bougé - 1988
25	A distributed protocol for channel-based communications with choice - Knabe - 1993
23	Some Facile Chemistry - Leth, Thomsen - 1995
21	Multiway synchronization verified with coupled simulation, in: R - Parrow, Sjodin - 1992
19	On the expressiveness of linda coordination primitives - Busi, Gorrieri, et al. - 2000
9	Constraints as Processes - Victor, Parrow - 1996
6	On determinacy and nondeterminacy in concurrent programming - Nestmann - 1996
5	Output Guards and Nondeterminism in "Communicating Sequential Processes - Bernstein - 1980
5	A Counter-Example to an Algorithm for the Generalized InputOutput - Kumar, Silberschatz - 1997
5	The name discipline of uniform receptiveness (extended abstract - Sangiorgi - 1997
3	Notes on Soundness of a Mapping from -calculus to -calculus. With comments added in - Honda - 1993
3	On The Turing-Equivalence of Linda Coordination Primitives - Busi, Gorrieri, et al. - 1997
1	CHAN(y) \Delta However, free names in process terms would, in their encoding, have to be supplied explicitly with their managers at the top-level of encodings - unknown authors