Describing distributed systems by categorical graph grammars
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.
Unable to display preview. Download preview PDF.
- P. Degano/U. Montanari: "A model for distributed systems based on graph rewriting", J. Assoc. Comput. Mach. 34, 2 (1987), p.411–449Google Scholar
- H. Ehrig: "Introduction to the algebraic theory of graph grammars (a survey)", Lect. Notes in Computer Science 73 (1979), p.1–69Google Scholar
- H. Ehrig: "Tutorial introduction to the algebraic approach of graph-grammars", Lect. Notes Computer Science 291 (1987), p.3–14Google Scholar
- H. Ehrig et al.: "Distributed parallelism of graph transformations", Lect. Notes Computer Science 314 (1988), p.1–19Google Scholar
- M. Jackel: "ADA-concurrency specified by graph grammars", Lect. Notes Computer Science 291 (1987), p.262–279Google Scholar
- H.J. Kreowski: "Is parallelism already concurrency? Part 1: Derivations in graph grammars", Lect. Notes in Computer Science 291 (1987), p.343–360Google Scholar
- 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–377Google Scholar
- F. Parisi-Presicce et al.: "Graph rewriting with unification and composition", Lect. Notes in Computer Science 291 (1987), p.496–514Google Scholar
- "The programming language Ada", Lect. Notes in Computer Science 155 (1983)Google Scholar