Abstract
In the paper we define grammars on a class of labeled, partially ordered hypergraphs, called distributed systems. A distributed system models both the spatial and the temporal aspects of a real system through the relations of adjacency and causality. Terminal symbols represent the (deterministic, certain) past history of the system while nonterminal symbols model the (possibly nondeterministic, potential) future history of the system. The (context free) productions of a grammar represent the possible stand-alone evolutions of system components. From the productions, we obtain a (possibly infinite) number of rewriting rules, which model the synchronized evolution of adjacent system components. The (terminal) distributed systems derived within a given grammar represent the alternative deterministic, concurrent computations of a single nondeterministic system which is thus completely modeled by the grammar.
Preview
Unable to display preview. Download preview PDF.
References
E.Astesiano, G.Reggio, E.Zucca. Operational Frameworks for Semantic Description of Concurrent Languages, with an application to ADA-like languages, Internal Report CNET-61, Dept. of Mathematics, Univ. of Genova.
R.Milner. A Calculus of Communicating Systems, Springer LNCS n∘ 92, 1980.
R.Milner. Calculi for Synchrony and Asynchrony, Internal Report CSR-104-82, Edinburgh University, February 1982
C.A.R.Hoare, S.D.Brookes, A.W.Roscoe. A Theory of Communicating Sequential Processes, Technical Monograph PRG-16, Programming Research Group, Oxford University, 1981.
C.A.Petri. Concurrency, Proc. Net Theory and Applications, Springer LNCS n∘ 84, 1980, pp. 251–260.
C.A.R. Hoare. Communicating Sequential Processes, Comm. ACM 21, August 1978, pp. 666–677.
M.Nielsen, G.Plotkin, G.Winskel. Petri nets, event structures and domains, part 1, TCS 13, 1981.
G.Winskel. Event structure semantics for CCS and related languages, ICALP '82, Springer LNCS n∘ 140, July 1982.
J.Winkowski. Behaviours of Concurrent Systems, TCS 11, 1980, pp. 39–60.
U.Montanari, C.Simonelli. On Distinguishing Concurrency from Nondeterminism, Proc. Réseaux de Petri et Parallélisme, Colleville sur mer, May 1980.
I.Castellani, P.Franceschi, U.Montanari. Labeled Event Structures: A Model for Observable Concurrency, IFIP TC 2 — Working Conference: Formal Description of Programming Concepts II, Garmisch — Partenkirchen, June 1982, NorthHolland, to appear.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Castellani, I., Montanari, U. (1983). Graph grammars for distributed systems. In: Ehrig, H., Nagl, M., Rozenberg, G. (eds) Graph-Grammars and Their Application to Computer Science. Graph Grammars 1982. Lecture Notes in Computer Science, vol 153. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0000097
Download citation
DOI: https://doi.org/10.1007/BFb0000097
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12310-1
Online ISBN: 978-3-540-39897-4
eBook Packages: Springer Book Archive