Abstract
Most semantic theories for process calculi presuppose that communication is synchronous; the sending and receiving processes must rendezvous for the communication to occur. However there is now considerable interest in process languages based on asynchronous communication, where the sender is not blocked but may transmit a message even in the absence of a waiting receiver. On the one hand this communication paradigm is much easier to implement and consequently has been adopted by numerous recently developed process languages, [4,7]. On the other hand it has been argued in papers such as [2,5] that, at least for pi-calculus based theories, asynchrony is a more basic concept in terms of which theories of synchronous communication can be established.
Despite this interest in asynchrony there has been little research into axiomatising process calculi based on this form of communication. In this talk I will survey existing results, such as those in [1,3], and discuss equational theories for synchronous versions of both value-passing CCS
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
R. Amadio, I. Castellani, and D. Sangiorgi. On bisimulations for the asynchronous π-calculus. Theoretical Computer Science, 195:291–324, 1998.
G. Boudol. Asynchrony and the π-calculus. Research Report 1702, INRIA, Sophia-Antipolis, 1992.
I. Castellani and M. Hennessy. Testing theories for asynchronous languages. In Proc. of FST-TCS 98, LNCS 1530, 1998.
C. Fournet, G. Gonthier, J. J. Levy, L. Marganget and D. Remy. A Calculus of Mobile Agents. In Proc. CONCUR’96, LLNCS 1119, 1996.
K. Honda and M. Tokoro. On asynchronous communication semantics. In Proc. Object-Based Concurrent Computing, LNCS 612, 1992.
R. Milner. Communication and Concurrency. Prentice Hall, 1989.
Benjamin C. Pierce and David N. Turner. Pict: A programming language based on the pi-calculus. Technical Report CSCI 476, Computer Science Department, Indiana University, 1997. To appear in Proof, Language and Interaction: Essays in Honour of Robin Milner, Gordon Plotkin, Colin Stirling, and Mads Tofte, editors, MIT Press.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hennessy, M. (1999). Axiomatising asynchronous process calculi. In: Ciobanu, G., Păun, G. (eds) Fundamentals of Computation Theory. FCT 1999. Lecture Notes in Computer Science, vol 1684. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48321-7_5
Download citation
DOI: https://doi.org/10.1007/3-540-48321-7_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66412-3
Online ISBN: 978-3-540-48321-2
eBook Packages: Springer Book Archive