First-order axioms for asynchrony

  • Peter Selinger
Contributions
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1243)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    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.Google Scholar
  2. [2]
    S. Abramsky, S. Gay, and R. Nagarajan. Interaction categories and typed concurrent programming. In Proceedings of the 1994 Marktoberdorf Summer School. Springer, 1994.Google Scholar
  3. [3]
    R. M. Amadio, I. Castellani, and D. Sangiorgi. On bisimulations for the asynchronous π-calculus. In CONCUR '96, Springer LNCS 1119, pages 147–162, 1996.Google Scholar
  4. [4]
    M. A. Bednarczyk. Categories of asynchronous systems. PhD thesis, University of Sussex, 1988.Google Scholar
  5. [5]
    G. Berry and G. Boudol. The chemical abstract machine. Theoretical Computer Science, 96:217–248, 1992.CrossRefGoogle Scholar
  6. [6]
    G. Boudol. Asynchrony and the π-calculus. Technical Report 1702, INRIA, Sophia-Antipolis, 1992.Google Scholar
  7. [7]
    C. Fournet and G. Gonthier. The reflexive cham and the join-calculus. In POPL '96, 1996.Google Scholar
  8. [8]
    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.Google Scholar
  9. [9]
    K. Honda and M. Tokoro. An object calculus for asynchronous communication. In Proc. ECOOP 91, Geneve, 1991.Google Scholar
  10. [10]
    N. A. Lynch and E. W. Stark. A proof of the Kahn principle for input/output automata. Information and Computation, 82:81–92, 1989.CrossRefGoogle Scholar
  11. [11]
    R. Milner. A Calculus of Communicationg Systems. Springer LNCS 92. 1980.Google Scholar
  12. [12]
    R. Milner. Operational and algebraic semantics of concurrent processes. Technical report, University of Edinburgh, Nov. 1987. Chapter for the Handbook of Theoretical Computer Science.Google Scholar
  13. [13]
    C. Palamidessi. Comparing the expressive power of the synchronous and the asynchronous π-calculus. In POPL '97 (Paris), 1997.Google Scholar
  14. [14]
    M.W. Shields. Concurrent machines. Theoretical Computer Science, 28:449–465, 1985.Google Scholar

Copyright information

© Springer-Verlag 1997

Authors and Affiliations

  • Peter Selinger
    • 1
  1. 1.Department of MathematicsUniversity of PennsylvaniaPhiladelphia

Personalised recommendations