Abstract
A new semantics for process description languages that discriminates according to the distribution in space of processes is proposed. The semantics is based on a set of distributed transition rules that record spatial information and on a notion of equivalence that discriminates according to which actions processes can perform and where these actions are performed. The new semantics is proven to coincide with the locality equivalence of Boudol, Castellani, Hennessy and Kiehn. Over the latter, it has the advantage of not requiring explicit introduction of a (infinite) space of locations; this makes the new equivalence amenable to a mechanical treatment in the same vein as the classical bisimulation-based equivalences. Indeed, we propose a polynomial time algorithm for checking locality equivalence of processes.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Aceto,L.: A static view of localities. Internal Report 1483, INRIA, 1991. Also in Formal Aspect of Computing (to appear).
Boudol,G., Castellani,I., Hennessy,M., Kiehn,A.: A Theory of Processes with Localities. In Proc. Concur 92 (W.R. Cleaveland, ed.), Springer-Verlag LNCS 630 (1992) 108–122.
Castellani,I.: Observing Distribution in Processes. In Proc. MFCS'93, Springer-Verlag LNCS 711 (1993).
Corradini,F., De Nicola,R.: Locality and Causality in Distributed Process Algebras. Internal Report SI⊵-93/05, University “La Sapienza” of Rome, 1993.
Castellani,I., Hennessy,M.: Distributed Bisimulations. Journal of ACM 36 (1989) 887–911.
Corradini,F., Murphy,D.: Located Processes and Located Processors. Internal Report SI⊵-94/02, University “La Sapienza” of Rome, 1994.
Degano,P., De Nicola, R., Montanari,U.: Partial Ordering Descriptions and Observations of Nondeterministic Concurrent Processes. In Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, LNCS 354 (1988) 438–466.
Degano,P., De Nicola,R., Montanari,U.: On the Operational Semantics of Distributed Concurrent Systems. In Declarative Systems (G. David, R.T. Boute and B.D. Shriver, eds.), North Holland (1990) 3–32.
Degano,P., Priami,C: Proved Trees. In Proc. Icalp92 (W. Kuich, ed.), LNCS 623 (1992) 629–640.
Ferrari,G., Gorrieri,R., Montanari,U.: An Extended Expansion Theorem. In Proc. Tapsoft91, Springer-Verlag LNCS 494 (1991) 29–48.
Kiehn,A.: Local and Global Causes. Internal Report, Institut für Informätik, TU Munchen, 1991.
Kanellakis,P.C., Smolka,S.C., CCS Expressions, Finite State Processes and Three Problems of Equivalence. In Proc. Second ACM Symposium on Principles of Distributed Computing (1983).
Milner,R.: Communication and Concurrency. Prentice-Hall International (1989).
Montanari,U., Yankelevich,D.: Partial Order localities. In Proc. Icalp92 (W. Kuich, ed.), LNCS 623 (1992) 617–628.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Corradini, F., De Nicola, R. (1994). Distribution and locality of concurrent systems. In: Abiteboul, S., Shamir, E. (eds) Automata, Languages and Programming. ICALP 1994. Lecture Notes in Computer Science, vol 820. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58201-0_65
Download citation
DOI: https://doi.org/10.1007/3-540-58201-0_65
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58201-4
Online ISBN: 978-3-540-48566-7
eBook Packages: Springer Book Archive