Formal Aspects of Computing

, Volume 6, Issue 2, pp 165–200 | Cite as

A theory of processes with localities

  • G. Boudol
  • I. Castellani
  • M. Hennessy
  • A. Kiehn


We study a notion of observation for concurrent processes which allows the observer to see the distributed nature of processes, giving explicit names for the location of actions. A general notion of bisimulation related to this observation of distributed systems is introduced. Our main result is that these bisimulation relations, particularized to a process algebra extending CCS, are completely axiomatizable. We discuss in detail two instances of location bisimulations, namely the location equivalence and the location preorder.


Bisimulation distributed bisimulation location equivalence location preorder 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Ace91]
    Aceto, L.:A static view of localities. Report 1483, INRIA, 1991.Google Scholar
  2. [Ace92]
    Aceto, L.: On relating concurrency and nondeterminism. InProc. MFPS 91, 1992.Google Scholar
  3. [BCH91a]
    Boudol, G., Castellani, I., Hennessy, M. and Kiehn, A.:Observing localities. Report 4/91, Sussex University, and INRIA Res. Rep. 1485, 1991. To appear inTheoretical Computer Science. Extended abstract in Proc. MFCS 91, LNCS 520, 1991.Google Scholar
  4. [BCH91b]
    Boudol, G., Castellani, I., Hennessy, M. and Kiehn, A.:A theory of processes with localities. Report 1632, INRIA, 1991. Extended abstract in Proc. CONCUR92, LNCS 630, 1992.Google Scholar
  5. [BeK85]
    Bergstra, J. and Klop, J.W.: Algebra of communicating processes with abstraction.Theoretical Computer Science, 37:77–121, 1985.Google Scholar
  6. [Cas88]
    Castellani, I.:Bisimulations for Concurrency. PhD thesis, University of Edinburgh, 1988.Google Scholar
  7. [CaH89]
    Castellani, I. and Hennessy, M.: Distributed bisimulations.JACM, 10(4):887–911, 1989.Google Scholar
  8. [DaD89]
    Darondeau, Ph. and Degano, P.: Causal trees. InProc. ICALP 88, pages 234–248, 1989.Google Scholar
  9. [DaD90]
    Darondeau, Ph. and Degano, P.: Causal trees: interleaving + causality. InSemantics of Systems of Concurrent Processes, pages 239–255, 1990.Google Scholar
  10. [DdNm87]
    Degano, P., De Nicola, R. and Montanari, U.: Observational equivalences for concurrency models. In M. Wirsing, editor,Formal Description of Programming Concepts-III, Proceedings of the 3 th IFIP WG 2.2 working conference, Ebberup 1986, pages 105–129, North-Holland, 1987.Google Scholar
  11. [Hen88]
    Hennessy, M.: Axiomatising finite concurrent processes.SIAM Journal of Computing, 17(5):997–1017, 1988.Google Scholar
  12. [HeM85]
    Hennessy, M. and Milner, R.: Algebraic laws for nondeterminism and concurrency.JACM, 32(1):137–161, 1985.Google Scholar
  13. [Kie89]
    Kiehn, A.:Distributed bisimulations for finite CCS. Report 7/89, University of Sussex, 1989.Google Scholar
  14. [Kie91]
    Kiehn, A.:Local and Global Causes. Report 342/23/91, Technische UniversitÄt München, 1991. Submitted for publication.Google Scholar
  15. [Mil79]
    Milner, M.: Flowgraphs and flow algebras.JACM, 26(4):794–818, 1979.Google Scholar
  16. [Mil80]
    Milner, M.:A Calculus of Communicating Systems. Volume 92 ofLecture Notes in Computer Science, Springer-Verlag, 1980.Google Scholar
  17. [Mil89]
    Milner, M.:Communication and Concurrency. Prentice-Hall, 1989.Google Scholar
  18. [MoY92]
    Montanari, U. and Yankelevich, D.: A parametric approach to localities. InProceedings ICALP 92, 1992.Google Scholar
  19. [vGG90]
    van Glabbeek, R. and Goltz, U.: Equivalences and refinement. InSemantics of Systems of Concurrent Processes, pages 309–333, 1990.Google Scholar

Copyright information

© BCS 1994

Authors and Affiliations

  • G. Boudol
    • 1
  • I. Castellani
    • 1
  • M. Hennessy
    • 2
  • A. Kiehn
    • 3
  1. 1.INRIASophia-Antipolis CedexFrance
  2. 2.CSAI, University of SussexBrightonUK
  3. 3.TUMMünchenGermany

Personalised recommendations