Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Distributed processes and location failures

Extended abstract

  • Session 12:Process Equivalences
  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1997)

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

Included in the following conference series:

Abstract

Site failure is an essential aspect of distributed systems; nonetheless its effect on programming language semantics remains poorly understood. To model such systems, we define a process calculus in which processes are run at distributed locations. The language provides operators to kill locations, to test the status (dead or alive) of locations, and to spawn processes at remote locations. Using a variation of bisimulation, we provide alternative characterizations of strong and weak barbed congruence for this language, based on an operational semantics that uses configurations to record the status of locations. We then derive a second, symbolic characterization in which configurations are replaced by logical formulae. In the strong case the formulae come from a standard propositional logic, while in the weak case a temporal logic with past time modalities is required. The symbolic characterization establishes that, in principle, barbed congruence for such languages can be checked efficiently using existing techniques.

Research funded by EPSRC project GR/K60701.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Samson Abramsky. The lazy lambda calculus. In Research Topics in Functional Programming, pages 65–117. Addison-Wesley, 1990.

    Google Scholar 

  2. Roberto Amadio and Sanjiva Prasad. Localities and failures. In FST-TCS, volume 880 of LNCS. Springer, 1994.

    Google Scholar 

  3. Roberto Amadio. From a concurrent λ-calculus to the μ-calculus. In Foundations of Computation Theory, volume 965 of LNCS. Springer, 1995.

    Google Scholar 

  4. Roberto Amadio. An asynchronous model of locality, failure, and process mobility. Technical report, Laboratoire d'Informatique de Marseille, 1997.

    Google Scholar 

  5. Roberto Amadio, Ilaria Castellani, and Davide Sangiorgi. On bisimulations for the asynchronous μ-calculus. In CONCUR96, volume 1119 of LNCS, pages 147–162. Springer, 1996.

    Google Scholar 

  6. J. C. M. Baeten and W. P. Weijland. Process Algebra. Cambridge University Press, 1990.

    Google Scholar 

  7. G. Boudol. A lambda calculus for (strict) parallel functions. Information and Control, 108:51–127, 1994.

    Google Scholar 

  8. G. Boudol, I. Castellani, M. Hennessy, and A. Kiehn. A theory of processes with localities. Formal Aspects of Computing, 6:165–200, 1994.

    Article  Google Scholar 

  9. I. Castellani. Observing distribution in processes: static and dynamic localities. International Journal of Foundations of Computer Science, 6(6):353–393, 1995.

    Article  Google Scholar 

  10. Flavio Corradini. Space, Time and Nondeterminismin Process Algebras. PhD thesis, Università Degli Studi di Roma “La Sapienza”, 1996.

    Google Scholar 

  11. C. Fournet and G. Gonthier. The refliexive CHAM and the join-calculus. In POPL94. ACM Press, 1994.

    Google Scholar 

  12. C. Fournet, G. Gonthier, J.J. Levy, L. Marganget, and D. Remy. A calculus of mobile agents. In CONCUR96, volume 1119 of LNCS, pages 406–421. Springer, 1996.

    Google Scholar 

  13. A. Giacalone, P. Mishra, and S. Prasad. A symmetric integration of concurrent and functional programming. International journal of Parallel Programming, 18(2):121–160, 1989.

    Article  Google Scholar 

  14. Andrew D. Gordon. Bisimilarity as a theory of functional programming. In MFPS, volume 1 of ENTCS, http://pigeon.elsevier.nl/mcs/tcs/pc/Menu.html.Elsevier, 1995.

    Google Scholar 

  15. M. C. B. Hennessy and H. Lin. Symbolic bisimulations. Theoretical Computer Science, 138:353–389, 1995.

    Article  Google Scholar 

  16. C. A. R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.

    Google Scholar 

  17. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent System: Specification. Springer, 1992.

    Google Scholar 

  18. Robin Milner. Communication and concurrency. Prentice-Hall, 1989.

    Google Scholar 

  19. Robin Milner, Joachim Parrow, and David Walker. A calculus of mobile processes. Information and Computation, 100(1), September 1992.

    Google Scholar 

  20. Ugo Montanari and Daniel Yankelovich. Partial order localities. In ICALP92, volume 623 of LNCS, pages 617–628. Springer, 1992.

    Google Scholar 

  21. James Riely and Matthew Hennessy. Distributed processes and location failures. Technical Report 2/97, University of Sussex, Department of Computer Science, http://www.cogs.susx.ac.uk, 1997.

    Google Scholar 

  22. Davide Sangiorgi. Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis, University of Edinburgh, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Cognitive and Computing Sciences, Univ. of Sussex, BN1 9QH, Falmer, Brighton, UK

    James Riely & Matthew Hennessy

Authors
  1. James Riely
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Matthew Hennessy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Pierpaolo Degano Roberto Gorrieri Alberto Marchetti-Spaccamela

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Riely, J., Hennessy, M. (1997). Distributed processes and location failures. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds) Automata, Languages and Programming. ICALP 1997. Lecture Notes in Computer Science, vol 1256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63165-8_203

Download citation

  • DOI: https://doi.org/10.1007/3-540-63165-8_203

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63165-1

  • Online ISBN: 978-3-540-69194-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation