Abstract

Abstract. We study properties of asynchronous communication independently of any concrete concurrent process paradigm. We give a general-purpose, mathematically rigorous definition of several notions of asynchrony in a natural setting where an agent is asynchronous if its input and/or output is filtered through a buffer or a queue, possibly with feedback. In a series of theorems, we give necessary and sufficient conditions for each of these notions in the form of simple first-order or second-order axioms. We illustrate the formalism by applying it to asynchronous CCS and the core join calculus.

Citations

426	The chemical abstract machine - Berry, Boudol - 1990
341	An object calculus for asynchronous communication - Honda, Tokoro - 1991
250	A calculus of mobile agents - Fournet, Gonthier, et al. - 1996
138	Comparing the expressive power of the synchronous and asynchronous π-calculi - Palamidessi - 2003
118	Operational and algebraic semantics of concurrent processes - Milner - 1990
88	Categories of Asynchronous Systems - Bednarczyk - 1988
87	Decoding Choice Encodings - Nestmann, Pierce - 2000
83	G.: The reflexive CHAM and the Join-calculus - Fournet, Gonthier - 1996
66	On bisimulations for the asynchronous -calculus - Amadio, Castellani, et al. - 1996
55	A proof of the Kahn principle for input/output automata - Lynch, Stark - 1989
46	A Simple Calculus for - Laneve, Tarissan - 2007
42	Concurrent machines - Shields - 1985
34	Integration Categories and Communicating Sequential Processes - Abramsky - 1994
31	The re exive CHAM and the join-calculus - Fournet, Gonthier - 1996
6	Interaction categories and typed concurrent programming - Abramsky, Gay, et al. - 1994
2	A Calculus of Communicationg Systems - Milner - 1980