Abstract

We introduce an asynchronous version of Milner's ß-calculus, based on the idea that the messages are elementary processes that can be sent without any sequencing constraint. We show that this simple message passing discipline, together with the restriction construct making a name private for an agent, is enough to encode the synchronous communication of the ß-calculus. 1. Introduction. The purpose of this note is to introduce an asynchronous variant of the ß-calculus of Milner, Parrow and Walker [8]. The ß-calculus is an extension of CCS, based on previous work by Engberg and Nielsen [5], that deals with name passing: in this calculus, agents pass channel names to other agents through named channels. The expressiveness of this link passing discipline has been demonstrated in [8] by a series of examples. Later on, Milner showed in [9] that even a restricted fragment of the original ß-calculus is enough to encode the -calculus. More precisely, he showed that one can mimic in a "mini" ß...

Citations

933	A calculus of mobile processes - Milner, Parrow, et al. - 1992
426	The chemical abstract machine - Berry, Boudol - 1990
341	An object calculus for asynchronous communication - Honda, Tokoro - 1991
290	Functions as processes - Milner - 1992
267	The Polyadic ?-calculus: A Tutorial - Milner - 1993
218	The lazy lambda calculus - Abramsky - 1990
61	Testing equivalence for mobile processes - Boreale, Nicola - 1995
50	The lazy lambda calculus in a concurrency scenario - Sangiorgi - 1994
36	Lambda-calculi for (strict) parallel functions - Boudol - 1994
24	Call-by-name, call-by-value and the -calculus. Theoretical Computer Science, 1(1):125{159 - Plotkin - 1976
7	A model for the -calculus - Hennessy - 1991
1	A calculus vvof communicating systems with label passing, Daimi PB-208 - Engberg, Nielsen - 1986