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.
KeywordsNormal Form Operational Semantic Proof System Identity Relation Access Path
Unable to display preview. Download preview PDF.
- [Ace89]L. Aceto. On relating concurrency and nondeterminism. Report 6/89, Computer Science, University of Sussex, Brighton, 1989.Google Scholar
- [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
- [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
- [Cas88]I. Castellani. Bisimulations for Concurrency. Ph.d. thesis, University of Edinburgh, 1988.Google Scholar
- [Kie89]A. Kiehn. Distributed bisimulations for finite CCS. Report 7/89, University of Sussex, 1989.Google Scholar
- [Kie91]A. Kiehn. Local and global causes. Report 342/23/91, Technische Universität München, 1991.Google Scholar
- [Mil80]R. Milner. A Calculus of Communicating Systems, volume 92 of Lecture Notes in Computer Science. 1980.Google Scholar
- [Mil89]R. Milner. Communication and Concurrency. Prentice-Hall, 1989.Google Scholar