Abstract
The structure of an asynchronous system of processes is described by a labeled hypergraph. It represents both the past and the present of the system. The set of all possible traces is defined by a hypergraph grammar. In the graph, actions and process states are represented by hyperedges. Each hyperedge is connected to some event nodes, some of which are considered to be predecessors of the edge, whereas others are successor nodes. This induces a partial ordering of the hyperedges. Some aspects of the Ada rendezvous are used as an example and translated into hypergraph productions.
This work was partly supported by Deutsche Forschungsgemeinschaft (SFB 182 — Project B1).
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
P. Degano/U. Montanari: "A model for distributed systems based on graph rewriting", J. Assoc. Comput. Mach. 34, 2 (1987), p.411–449
H. Ehrig: "Introduction to the algebraic theory of graph grammars (a survey)", Lect. Notes in Computer Science 73 (1979), p.1–69
H. Ehrig: "Tutorial introduction to the algebraic approach of graph-grammars", Lect. Notes Computer Science 291 (1987), p.3–14
H. Ehrig et al.: "Distributed parallelism of graph transformations", Lect. Notes Computer Science 314 (1988), p.1–19
M. Jackel: "ADA-concurrency specified by graph grammars", Lect. Notes Computer Science 291 (1987), p.262–279
H.J. Kreowski: "Is parallelism already concurrency? Part 1: Derivations in graph grammars", Lect. Notes in Computer Science 291 (1987), p.343–360
H.J. Kreowski/A. Wilharm: "Is parallelism already concurrency? Part 2: Non sequential processes in graph grammars", Lect. Notes in Computer Science 291 (1987), p.361–377
F. Parisi-Presicce et al.: "Graph rewriting with unification and composition", Lect. Notes in Computer Science 291 (1987), p.496–514
E.G. Wagner: "A categorical treatment of pre-and post-conditions", Theoretical Computer Science 53 (1987), p.3–24
"The programming language Ada", Lect. Notes in Computer Science 155 (1983)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schneider, H.J. (1990). Describing distributed systems by categorical graph grammars. In: Nagl, M. (eds) Graph-Theoretic Concepts in Computer Science. WG 1989. Lecture Notes in Computer Science, vol 411. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52292-1_9
Download citation
DOI: https://doi.org/10.1007/3-540-52292-1_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52292-8
Online ISBN: 978-3-540-46950-6
eBook Packages: Springer Book Archive