A theory of processes with localities

  • G. Boudol
  • I. Castellani
  • M. Hennessy
  • A. Kiehn
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 630)


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 details two instances of location bisimulations, namely the location equivalence and the location preorder.


Normal Form Operational Semantic Proof System Identity Relation Access Path 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Ace89]
    L. Aceto. On relating concurrency and nondeterminism. Report 6/89, Computer Science, University of Sussex, Brighton, 1989.Google Scholar
  2. [BCHK91]
    G. Boudol, I. Castellani, M. Hennessy, and A. Kiehn. Observing localities. Report 4/91, Sussex University, and INRIA Res. Rep. 1485, 1991. To appear in TCS.Google Scholar
  3. [BCHK92]
    G. Boudol, I. Castellani, M. Hennessy, and A. Kiehn. A theory of processes with localities. Report 13/91, Sussex University, and INRIA Res. Rep. 1632, 1992.Google Scholar
  4. [Cas88]
    I. Castellani. Bisimulations for Concurrency. Ph.d. thesis, University of Edinburgh, 1988.Google Scholar
  5. [CH89]
    I. Castellani and M. Hennessy. Distributed bisimulations. JACM, 10(4):887–911, 1989.MathSciNetCrossRefGoogle Scholar
  6. [DD89]
    Ph. Darondeau and P. Degano. Causal trees. In Proc. ICALP 88, volume 372 of LNCS, pages 234–248, 1989.MathSciNetGoogle Scholar
  7. [IIM85]
    M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. JACM, 32(1):137–161, 1985.zbMATHMathSciNetCrossRefGoogle Scholar
  8. [Kie89]
    A. Kiehn. Distributed bisimulations for finite CCS. Report 7/89, University of Sussex, 1989.Google Scholar
  9. [Kie91]
    A. Kiehn. Local and global causes. Report 342/23/91, Technische Universität München, 1991.Google Scholar
  10. [Mil80]
    R. Milner. A Calculus of Communicating Systems, volume 92 of Lecture Notes in Computer Science. 1980.Google Scholar
  11. [Mil89]
    R. Milner. Communication and Concurrency. Prentice-Hall, 1989.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • G. Boudol
    • 1
  • I. Castellani
    • 1
  • M. Hennessy
    • 2
  • A. Kiehn
    • 3
  1. 1.INRIASophia-Antipolis
  2. 2.CSAIUniversity of SussexEngland
  3. 3.TUMMunich

Personalised recommendations