Skip to main content

An asynchronous model of locality, failure, and process mobility

  • Regular Papers
  • Conference paper
  • First Online:

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

Abstract

We present a model of distributed computation which is based on a fragment of the π-calculus relying on asynchronous communication. We enrich the model with the following features: the explicit distribution of processes to locations, the failure of locations and their detection, and the mobility of processes. Our contributions are two folds. At the specification level, we give a synthetic and flexible formalization of the features mentioned above. At the verification level, we provide original methods to reason about the bisimilarity of processes in the presence of failures.

CMI, 39 rue Joliot-Curie F-13453, Marseille, France. This work was partially supported by CTI-CNET 95-1B-182, Cefipra project 1502-1, and Working group Confer.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Amadio. An asynchronous model of locality, failure, and process mobility. RR-INRIA 3109. Available at http://protis.univ-mrs.fr/~amadio/.

    Google Scholar 

  2. R. Amadio, I. Castellani, and D. Sangiorgi. On bisimulations for the asynchronous π-calculus. In CONCUR 96, SLNCS. 1119, 1996.

    Google Scholar 

  3. R. Amadio, L. Leth, and B. Thomsen. From a concurrent λ-calculus to the π-calculus. In Proc. Foundations of Computation Theory 95, SLNCS 965, 1995.

    Google Scholar 

  4. R. Amadio and S. Prasad. Localities and Failures (Extended Summary). In Proc. of FST-TCS94 SLNCS 880, 1994.

    Google Scholar 

  5. M. Boreale. On the expressiveness of internal mobility in name passing calculi. In CONCUR 96, SNLCS 1119, 1996.

    Google Scholar 

  6. G. Boudol. Asynchrony and the π-calculus. RR-INRIA 1702, 1992.

    Google Scholar 

  7. G. Boudol. Some chemical abstract machines. In Proc. of REX School, SLNCS 803, 1993.

    Google Scholar 

  8. T. Chandra and S. Toueg. Unreliable failure detectors for reliable distributed systems. Journal of ACM, 43(2):225–267, 1996.

    Article  Google Scholar 

  9. C. Fournet and G. Gonthier. The reflexive CRAM and the join-calculus. Proc. POPL, 1996.

    Google Scholar 

  10. C. Fournet, G. Gonthier, J.-J. Levy, L. Maranget, and D. Rémy. A calculus of mobile agents. In CONCUR 96, SLNCS 1119, 1996.

    Google Scholar 

  11. K. Honda and M. Tokoro. An object calculus for asynchronous communication. Proc. ECOOP 91, Geneve, 1991.

    Google Scholar 

  12. N. Kobayashi, B. Pierce, and D. Turner. Linearity in the π-calculus. Proc. POPL, 1996.

    Google Scholar 

  13. R. Milner, J. Parrow, and D. Walker. A Calculus of Mobile Process, Parts 1–2. Information and Computation, 100(1):1–77, 1992.

    Article  Google Scholar 

  14. B. Pierce and D. Sangiorgi. Typing and subtyping for mobile processes. In Proc. LICS, 1993.

    Google Scholar 

  15. D. Sangiorgi. π-calculus, internal mobility and agent-passing calculi. In Proc Tapsoft 95, SLNCS 915, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

David Garlan Daniel Le Métayer

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Amadio, R.M. (1997). An asynchronous model of locality, failure, and process mobility. In: Garlan, D., Le Métayer, D. (eds) Coordination Languages and Models. COORDINATION 1997. Lecture Notes in Computer Science, vol 1282. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63383-9_92

Download citation

  • DOI: https://doi.org/10.1007/3-540-63383-9_92

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63383-9

  • Online ISBN: 978-3-540-69527-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics