A theory of processes with localities-Reference-Cited by-同舟云学术

A theory of processes with localities

Published:1994-03 Issue:2 Volume:6 Page:165-200
ISSN:0934-5043
Container-title:Formal Aspects of Computing
language:en
Short-container-title:Form. Asp. Comput.

Author:

Boudol G.¹,Castellani I.¹,Hennessy M.²,Kiehn A.³

Affiliation:

1. INRIA, BP 93, 06902, Sophia-Antipolis Cedex, France

2. CSAI, University of Sussex, Brighton, UK

3. TUM, München, Germany

Abstract

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.

Publisher

Association for Computing Machinery (ACM)

Subject

Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01221098.pdf

Reference19 articles.

1. Aceto L.: A static view of localities . Report 1483 INRIA 1991.

2. Aceto L.: On relating concurrency and nondeterminism. In Proc. MFPS 91 1992.

3. Boudol G. Castellani I. Hennessy M. and Kiehn A.: Observing localities . Report 4/91 Sussex University and INRIA Res. Rep. 1485 1991. To appear in Theoretical Computer Science . Extended abstract in Proc. MFCS 91 LNCS 520 1991.

4. 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.

5. Algebra of communicating processes with abstraction

Cited by 43 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Store Locally, Prove Globally;Theoretical Aspects of Computing – ICTAC 2023;2023

2. Bisimulations Respecting Duration and Causality for the Non-interleaving Applied π-Calculus;Electronic Proceedings in Theoretical Computer Science;2022-09-06

3. A calculus of branching processes;Theoretical Computer Science;2020-02

4. Ensuring liveness properties of distributed systems: Open problems;Journal of Logical and Algebraic Methods in Programming;2019-12

5. A fully abstract semantics for value-passing CCS for trees;Frontiers of Computer Science;2019-06-18