Skip to main content
SpringerLink
Log in

Basic Theory of Reduction Congruence forTwo Timed Asynchronous π-Calculi

  • Conference paper
CONCUR 2004 - Concurrency Theory (CONCUR 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3170))

Included in the following conference series:

Abstract

We study reduction congruence, the most widely used notion of equality for the asynchronous π-calculus with timers, and derive several alternative characterisations, one of them being a labelled asynchronous bisimilarity. These results are adapted to an asynchronous π-calculus with timers, locations and message failure. In addition we investigate the problem of how to distribute value-passing processes in a semantics-preserving way.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abdulla, P.A., Jonsson, B.: Verifying programs with unreliable channels. Info. & Comp. 127(2), 91–101 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  2. Amadio, R.M.: An asynchronous model of locality, failure, and process mobility. In: Garlan, D., Le Métayer, D. (eds.) COORDINATION 1997. LNCS, vol. 1282. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  3. Amadio, R.M., Prasad, S.: Localities and failures. In: Thiagarajan, P.S. (ed.) FSTTCS 1994. LNCS, vol. 880. Springer, Heidelberg (1994)

    Google Scholar 

  4. Berger, M.: Towards Abstractions for Distributed Systems. PhD thesis, Imperial College, London (2002)

    Google Scholar 

  5. Berger, M., Honda, K.: The Two-Phase Commit Protocol in an Extended π-Calculus. In: Proc. EXPRESS 2000. ENTCS, vol. 39 (2000)

    Google Scholar 

  6. Berger, M., Honda, K., Yoshida, N.: Sequentiality and the π-calculus. In: Abramsky, S. (ed.) TLCA 2001. LNCS, vol. 2044, p. 29. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  7. Berger, M., Honda, K., Yoshida, N.: Genericity and the π-Calculus. In: Gordon, A.D. (ed.) FOSSACS 2003. LNCS, vol. 2620, pp. 103–119. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  8. Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.): Handbook of Process Algebra. Elsevier, Amsterdam (2001)

    MATH  Google Scholar 

  9. Börger, E., Stärk, R.: Abstract State Machines: A Method for High-Level System Design and Analysis. Springer, Heidelberg (2003)

    Book  MATH  Google Scholar 

  10. Carbone, M., Maffeis, S.: On the expressive power of polyadic synchronisation in π-calculus. In: Proc. EXPRESS 2002. ENTCS, vol. 68 (2002)

    Google Scholar 

  11. Cardelli, L., Gordon, A.: Mobile ambients. TCS 240 (2000)

    Google Scholar 

  12. Fournet, C., Gonthier, G.: A hierarchy of equivalences for asynchronous calculi. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, Springer, Heidelberg (1998)

    Google Scholar 

  13. Fournet, C., Gonthier, G., Lévy, J.-J., Maranget, L., Rémy, D.: A Calculus of Mobile Agents. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol. 1119, Springer, Heidelberg (1996)

    Google Scholar 

  14. Hennessy, M.: Timed process algebras: a tutorial. Tech. Rep. CS 1993:02, University of Sussex, Computer Science Department (1993)

    Google Scholar 

  15. Honda, K.: Two bisimilarities in ν-calculus. Tech. Rep. 92-002, Keio University, Department of Computer Science (1992)

    Google Scholar 

  16. Honda, K., Tokoro, M.: On asynchronous communication semantics. In: Tokoro, M., Wegner, P., Nierstrasz, O. (eds.) ECOOP-WS 1991. LNCS, vol. 612, Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  17. Honda, K., Yoshida, N.: On reduction-based process semantics. TCS 151 (1995)

    Google Scholar 

  18. Honda, K., Yoshida, N.: A uniform type structure for secure information flow. In: POPL 2002, pp. 81–92. ACM Press, New York (2002)

    Google Scholar 

  19. Mills, D.: Time synchronization server. URL, http://www.eecis.udel.edu/~ntp/

  20. Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, parts I and II. Info. & Comp. 100(1) (1992)

    Google Scholar 

  21. Milner, R., Sangiorgi, D.: Barbed bisimulation. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, Springer, Heidelberg (1992)

    Google Scholar 

  22. Riely, J., Hennessy, M.: Distributed processes and location failures. TCS 226 (2001)

    Google Scholar 

  23. Sangiorgi, D., Walker, D.: The π-Calculus: a Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)

    MATH  Google Scholar 

  24. Sewell, P.: Global/Local Subtyping and Capability Inference for a Distributed π-calculus. In: Fiat, A. (ed.) Dagstuhl Seminar 1996. LNCS, vol. 1442, Springer, Heidelberg (1998)

    Google Scholar 

  25. Wojciechowski, P.: Nomadic Pict: Language and Infrastructure Design for Mobile Computation. PhD thesis, University of Cambridge (2000)

    Google Scholar 

  26. Yoshida, N., Berger, M., Honda, K.: Strong Normalisation in the π-Calculus. In: Proc. LICS 2001, pp. 311–322. IEEE, Los Alamitos (2001); The full version to appear in Journal of Information and Computation

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, Queen Mary, Univ. of London, UK

    Martin Berger

Authors
  1. Martin Berger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computing, Imperial College London, 180 Queen’s Gate, SW7 2AZ, London, UK

    Philippa Gardner

  2. Department of Computing, Imperial College, London, UK

    Nobuko Yoshida

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Berger, M. (2004). Basic Theory of Reduction Congruence forTwo Timed Asynchronous π-Calculi. In: Gardner, P., Yoshida, N. (eds) CONCUR 2004 - Concurrency Theory. CONCUR 2004. Lecture Notes in Computer Science, vol 3170. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28644-8_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-28644-8_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22940-7

  • Online ISBN: 978-3-540-28644-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation