Abstract
This work studies the notion of locality in the context of process specification. It relates naturally with other works where information about the localities of a program is obtained information from its description written down in a programming language.
This paper presents a new approach for this problem. In our case, the information about the system will be given in semantic terms using asynchronous transition systems. Given an asynchronous transition system we build an algebra of localities whose models are possible implementations of the known system. We present different results concerning the models for the algebra of localities. In addition, our approach neatly considers the relation of localities and non-determinism.
This work is supported by the CONICYT/BID project 140/94 from Uruguay
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aceto, L.: A static view of localities. Formal Aspects of Computing (1994)
Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science 126 (1994)
Amadio, R.M.: An asynchronous model of locality, failure, and process mobility. Technical Report 3109, INRIA Sophia Antipolis (February 1997)
Boudol, G., Castellani, I., Hennessy, M., Kiehn, A.: Observing localities. Theoretical Computer Science 114, 31–61 (1993)
Boudol, G., Castellani, I., Hennesy, M., Kiehn, A.: A theory of processes with localities. Formal Aspects of Computing 6(2), 165–200 (1994)
Castellani, I.: Observing distribution in processes: static and dynamic localities. Int. Journal of Foundations of Computer Science (1995)
Degano, P., Nicola, R.D., Montanari, U.: Partial orderings descriptions and observations of nondeterministic concurrent processes. In: REX School and Workshop on Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency (1989)
Glabbeek, R.v.: Comparative Concurrency Semantics and Refinement of Actions. PhD thesis, Free University, Amsterdam (1990)
Montanari, U., Pistore, M., Yankelevich, D.: Efficient minimization up to location equivalence. In: Riis Nielson, H. (ed.) ESOP 1996. LNCS, vol. 1058. Springer, Heidelberg (1996)
Montanari, U., Yankelevich, D.: A parametric approach to localities. In: Proceedings 19th ICALP, Vienna (1992)
Montanari, U., Yankelevich, D.: Location equivalence in a parametric setting. Theoretical Computer Science 149, 299–332 (1995)
Nielsen, M., Plotkin, G., Winskel, G.: Petri nets, event structures and domains, part I. Theoretical Computer Science 13(1), 85–108 (1981)
Reisig, W.: Petri nets – an introduction. EATCS Monographs on Theoretical Computer Science, vol. 4. Springer, Heidelberg (1985)
Shields, M.: Deterministic asynchronous automata. In: Formal Methods in Programming. North-Holland, Amsterdam (1985)
Vogler, W.: Bisimulation and action refinement. Theoretical Computer Science 114, 173–200 (1993)
Winskel, G., Nielsen, M.: Models for concurrency. Technical Report DAIMI PB-492, Comp. Sci. Dept., Aarhus Univ. (November 1992)
Yankelevich, D.: Parametric views of process description languages. PhD thesis, University of Pisa (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sierra Abbate, L.R., D’Argenio, P.R., Echagüe, J.V. (2000). From Semantics to Spatial Distribution. In: Gonnet, G.H., Viola, A. (eds) LATIN 2000: Theoretical Informatics. LATIN 2000. Lecture Notes in Computer Science, vol 1776. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10719839_42
Download citation
DOI: https://doi.org/10.1007/10719839_42
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67306-4
Online ISBN: 978-3-540-46415-0
eBook Packages: Springer Book Archive