Abstract
Location equivalence is a bisimulation based equivalence for process calculi which is able to take into account the distributed nature of processes; the underlying idea is that each action occurs at a particular location.
The definition of bisimulation for location equivalence is not the standard one, since it must deal with the creation of new locations, and this leads to the necessity of using specific algorithms. In particular these algorithms work only on pairs of agents and do not allow to find the minimal representative for a class of equivalent agents.
In this paper we associate to every agent a labeled transition system (in which the informations on the locations appear in the labels) so that location-equivalent agents are mapped into transition systems which are bisimilar according to the ordinary definition of bisimulation. The main consequence of this result is that the standard algorithms for ordinary bisimulation can be re-used, and in particular the partitioning algorithm which allows to obtain the minimal realization of a single agent.
Research supported in part by Esprit Basic Research project CONFER and by Progetto Coordinato CNR “Strumenti per la Verifica di Proprietà Critiche di Sistemi Concorrenti e Distribuiti”.
Research supported in part by Universidad de Buenos Aires, under UBACyT project EX186, and by Università di Pisa.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
L. Aceto. A static view of localities. INRIA Report 1483, 1991. To appear in Formal Aspects of Computing.
G. Berry and G. Boudol. The chemical abstract machine. In Proc. POPL. ACM, 1990.
G. Boudol, I. Castellani, M. Hennessy and A. Kiehn. Observing localities. Theoretical Computer Science, 114: 31–61, 1993.
G. Boudol, I. Castellani, M. Hennessy and A. Kiehn. A theory of processes with localities. INRIA Report 1632, 1991. Extended abstract in Proc. CONCUR'92, LNCS 630, 1992.
I. Castellani. Observing distribution in processes: static and dynamic localities. INRIA Report 2276, 1994.
F. Corradini and R. De Nicola. Distribution and locality of concurrent systems. In Proc. ICALP'94, LNCS 920, pages 154–165. Springer Verlag, 1994.
P. Inverardi and C. Priami. Evaluation of tools for the analysis of communicating systems. In Bullettin of EATCS, 45, 1991.
A. Kiehn. Local and global causes. Tech. Rep. 42/23/91, Institut für Informatik, TU München, 1991.
R. Milner. Communication and Concurrency. Prentice Hall, 1989.
R. Milner. The polyadic π-calculus: a tutorial. In Logic and Algebra of Specification, NATO ASI Series F, Vol. 94. Springer Verlag, 1993.
U. Montanari and D. Yankelevich. A parametric approach to localities. In Proc. ICALP'92, LNCS 623. Springer Verlag, 1992.
U. Montanari and D. Yankelevich. Location Equivalence in a Parametric Setting. Theoretical Computer Science, 149: 299–332, 1995.
R. Paige and R. E. Tarjan. Three partition refinement algorithms. SIAM Journal on Computing, 16(6):973–989, 1987.
D. Yankelevich. Parametric Views of Process Description Languages. PhD Thesis. Dipartimento di Informatica, Universitá di Pisa, 1993. Available as report TD-23/93.
Proceedings of the Conference on Computer-Aided Verification — CAV'95, LNCS 939. P. Wolper Ed., Springer Verlag, 1995.
Proceedings of the International Symposium on Protocol Specification, Testing and Verification — PSTV'95. IFIP WG 6.1, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Montanari, U., Pistore, M., Yankelevich, D. (1996). Efficient minimization up to location equivalence. In: Nielson, H.R. (eds) Programming Languages and Systems — ESOP '96. ESOP 1996. Lecture Notes in Computer Science, vol 1058. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61055-3_42
Download citation
DOI: https://doi.org/10.1007/3-540-61055-3_42
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61055-7
Online ISBN: 978-3-540-49942-8
eBook Packages: Springer Book Archive