A static view of localities
- 1 March 1994
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 6 (2) , 201-222
- https://doi.org/10.1007/bf01221099
Abstract
This paper proposes alternative, effective characterizations for nets of automata of the location equivalence and preorder presented by Boudol et al. in the companion paper [BCHK]. Contrary to the technical development in the above given reference, where locations are dynamically associated to the subparts of a process in the operational semantics, the equivalence and preorder we propose are based on a static association of locations to the parallel components of a net. Following this static approach, it is possible to give these “distributed nets” a standard operational semantics which associates with each net a finite labelled transition system. Using this operational semantics for distributed nets, we introduce effective notions of equivalence and preorder which are shown to coincide with those proposed in [BCHK].Keywords
This publication has 6 references indexed in Scilit:
- Universal axioms for bisimulationsTheoretical Computer Science, 1993
- Proved treesPublished by Springer Nature ,1992
- A parametric approach to localitiesPublished by Springer Nature ,1992
- Distributed CCSPublished by Springer Nature ,1991
- Distributed bisimulationsJournal of the ACM, 1989
- A Non-Interleaving Semantics for CCS Based on Proved TransitionsFundamenta Informaticae, 1988