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.
This research was supported by an Alfred P. Sloan Doctoral Dissertation Fellowship.
Preview
Unable to display preview. Download preview PDF.
References
S. Abramsky. Interaction categories and communicating sequential processes. In A. W. Roscoe, editor, A Classical Mind: Essays in honour of C. A. R. Hoare, pages 1–16. Prentice Hall International, 1994.
S. Abramsky, S. Gay, and R. Nagarajan. Interaction categories and typed concurrent programming. In Proceedings of the 1994 Marktoberdorf Summer School. Springer, 1994.
R. M. Amadio, I. Castellani, and D. Sangiorgi. On bisimulations for the asynchronous π-calculus. In CONCUR '96, Springer LNCS 1119, pages 147–162, 1996.
M. A. Bednarczyk. Categories of asynchronous systems. PhD thesis, University of Sussex, 1988.
G. Berry and G. Boudol. The chemical abstract machine. Theoretical Computer Science, 96:217–248, 1992.
G. Boudol. Asynchrony and the π-calculus. Technical Report 1702, INRIA, Sophia-Antipolis, 1992.
C. Fournet and G. Gonthier. The reflexive cham and the join-calculus. In POPL '96, 1996.
C. Fournet, G. Gonthier, J.-J. Levy, L. Maranget, and D. Remy. A calculus of mobile agents. In CONCUR '96, Springer LNCS 1119, pages 406–421, 1996.
K. Honda and M. Tokoro. An object calculus for asynchronous communication. In Proc. ECOOP 91, Geneve, 1991.
N. A. Lynch and E. W. Stark. A proof of the Kahn principle for input/output automata. Information and Computation, 82:81–92, 1989.
R. Milner. A Calculus of Communicationg Systems. Springer LNCS 92. 1980.
R. Milner. Operational and algebraic semantics of concurrent processes. Technical report, University of Edinburgh, Nov. 1987. Chapter for the Handbook of Theoretical Computer Science.
C. Palamidessi. Comparing the expressive power of the synchronous and the asynchronous π-calculus. In POPL '97 (Paris), 1997.
M.W. Shields. Concurrent machines. Theoretical Computer Science, 28:449–465, 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Selinger, P. (1997). First-order axioms for asynchrony. In: Mazurkiewicz, A., Winkowski, J. (eds) CONCUR '97: Concurrency Theory. CONCUR 1997. Lecture Notes in Computer Science, vol 1243. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63141-0_26
Download citation
DOI: https://doi.org/10.1007/3-540-63141-0_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63141-5
Online ISBN: 978-3-540-69188-4
eBook Packages: Springer Book Archive