Abstract
Location equivalence has been presented in [3] as a bisimulation based equivalence able to take into account the spatial distribution of processes.
In this work, the parametric approach of [9] is applied to location equivalence. An observation domain for localities is identified and the resulting equivalence is shown to coincide with the equivalence introduced in [4, 13]. The observation of a computation is a forest (defined up to isomorphism) whose nodes are the events (labeled by observable actions) and where the arcs describe the sub-location relation.
We show in the paper that our approach is really parametric. By performing minor changes in the definitions, many equivalences are captured: partial and mixed ordering causal semantics, interleaving, and a variation of location equivalence where the generation ordering is not evidenced. It seems difficult to modify the definitions of [4, 13] to obtain the last observation. The equivalence induced by this observation corresponds to the very intuitive assumption that different locations cannot share any common clock, and hence the ordering between events occurring in different places cannot be determined.
Thanks to the general results proved in [9] for the parametric approach, all the observation equivalences described in the paper come equipped with sound and complete axiomatizations.
Research partially supported by Hewlett — Packard, Pisa Science Center, within the MDC project.
Preview
Unable to display preview. Download preview PDF.
References
L. Aceto. History preserving, causal and mixed-ordering equivalence for stable event structures. Technical Memo HPL-PSC-91-28, Hewlett-Packard Labs, Pisa, 1991.
G. Boudol and I. Castellani. A non-interleaving semantics for CCS based on proved transitions. Fundamenta Informaticae, 11(4):433–452, 1988.
G. Boudol, I. Castellani, M. Henaessy, and A. Kiehn. Observing localities. Technical Report 4/91, University of Sussex, March 1991.
G. Boudol, I. Castellani, M. Hennessy, and A. Kiehn. A theory of processes with localities. Technical Report 13/91, University of Sussex, December 1991.
I. Castellani and M. Hennessy. Distributed bisimulations. J. ACM, 36(4):887–911, 1989.
P. Darondeau and P. Degano. Causal trees. In Proc. ICALP 89, vol. 372 of LNCS, pages 234–248. Springer-Verlag, 1989.
P. Degano, R. De Nicola, and U. Montanari. Observational equivalences for concurrency models. In Proc. of the 3th IFIP WG 2.2 working conference, Ebberup, pages 105–129. North-Holland, 1987.
P. Degano, R. De Nicola, and U. Montanari. Partial orderings descriptions and observations of nondeterministic concurrent processes. In Proc. of the REX School/Workshop, Noordwijkerhout, vol. 354 of LNCS, pages 438–466. Springer-Verlag, 1989.
P. Degano, R. De Nicola, and U. Montanari. Universal axioms for bisimulation, 1991. Submitted for publication. An extended abstract appeared in Proc. of the Workshop on Concurrency and Compositionality, Goslar.
P. Degano and C. Priami. Proved trees, 1992. This volume.
G. Ferrari and U. Montanari. The observation algebra of spatial pomsets. In Proceedings CONCUR'91, vol. 527 of LNCS, pages 188–202. Springer-Verlag, 1991.
P. Inverardi, C. Priami, and D. Yankelevich. A parametric verification tool for distributed concurrent systems, 1992. Submitted to CAV'92 — Montreal.
A. Kiehn. Local and global causes. Technical Report 342/23/91, Technische Universitat Munchen, Munich, 1991.
R. Milner. Communication and Concurrency. Prentice-Hall International, Englewood Cliffs, 1989.
G. Plotkin. A structural approach to operational semantics. Report DAIMI FN-19, Computer Science Department, Aarhus University, 1981.
A. Rabinovich and B. Trakhtenbrot. Behavior structures and nets. Fundamenta Informaticae, 11(4):357–404, 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Montanari, U., Yankelevich, D. (1992). A parametric approach to localities. In: Kuich, W. (eds) Automata, Languages and Programming. ICALP 1992. Lecture Notes in Computer Science, vol 623. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55719-9_109
Download citation
DOI: https://doi.org/10.1007/3-540-55719-9_109
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55719-7
Online ISBN: 978-3-540-47278-0
eBook Packages: Springer Book Archive