A theory of processes with localities

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.

[1]  Philippe Darondeau,et al.  Causal Trees: Interleaving + Causality , 1989, Semantics of Systems of Concurrent Processes.

[2]  Ursula Goltz,et al.  Equivalences and Refinement , 1990, Semantics of Systems of Concurrent Processes.

[3]  Jan A. Bergstra,et al.  Algebra of Communicating Processes with Abstraction , 1985, Theor. Comput. Sci..

[4]  Philippe Darondeau,et al.  Causal Trees , 1989, ICALP.

[5]  Rocco De Nicola,et al.  Observational equivalences for concurrency models , 1987, Formal Description of Programming Concepts.

[6]  Robin Milner,et al.  Algebraic laws for nondeterminism and concurrency , 1985, JACM.

[7]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[8]  Matthew Hennessy,et al.  Observing Localities , 1993, Theor. Comput. Sci..

[9]  Matthew Hennessy,et al.  Distributed bisimulations , 1989, JACM.

[10]  Robin Milner,et al.  Flowgraphs and Flow Algebras , 1979, JACM.

[11]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[12]  Luca Aceto,et al.  On Relating Concurency and Nondeterminism , 1991, MFPS.

[13]  Matthew Hennessy,et al.  Axiomatising Finite Concurrent Processes , 1988, SIAM J. Comput..

[14]  Ilaria Castellani,et al.  Bisimulations for concurrency , 1987 .

[15]  Ugo Montanari,et al.  A Parametric Approach to Localities , 1992, ICALP.