A theory of processes with localities
- 1 March 1994
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 6 (2) , 165-200
- https://doi.org/10.1007/bf01221098
Abstract
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.Keywords
This publication has 12 references indexed in Scilit:
- On relating concurrency and nondeterminismPublished by Springer Nature ,1992
- Observing localitiesLecture Notes in Computer Science, 1991
- Equivalences and refinementPublished by Springer Nature ,1990
- Causal trees interleaving + causalityPublished by Springer Nature ,1990
- Distributed bisimulationsJournal of the ACM, 1989
- Causal treesPublished by Springer Nature ,1989
- Axiomatising Finite Concurrent ProcessesSIAM Journal on Computing, 1988
- Algebra of communicating processes with abstractionTheoretical Computer Science, 1985
- Algebraic laws for nondeterminism and concurrencyJournal of the ACM, 1985
- Flowgraphs and Flow AlgebrasJournal of the ACM, 1979