Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Graph-Theoretic Concepts in Computer Science

WG 1989: Graph-Theoretic Concepts in Computer Science pp 121–135Cite as

Describing distributed systems by categorical graph grammars

  • Graph Grammars: Theory And Application
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 411))

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.

Unable to display preview. Download preview PDF.

References

  1. P. Degano/U. Montanari: "A model for distributed systems based on graph rewriting", J. Assoc. Comput. Mach. 34, 2 (1987), p.411–449

    Google Scholar 

  2. H. Ehrig: "Introduction to the algebraic theory of graph grammars (a survey)", Lect. Notes in Computer Science 73 (1979), p.1–69

    Google Scholar 

  3. H. Ehrig: "Tutorial introduction to the algebraic approach of graph-grammars", Lect. Notes Computer Science 291 (1987), p.3–14

    Google Scholar 

  4. H. Ehrig et al.: "Distributed parallelism of graph transformations", Lect. Notes Computer Science 314 (1988), p.1–19

    Google Scholar 

  5. M. Jackel: "ADA-concurrency specified by graph grammars", Lect. Notes Computer Science 291 (1987), p.262–279

    Google Scholar 

  6. H.J. Kreowski: "Is parallelism already concurrency? Part 1: Derivations in graph grammars", Lect. Notes in Computer Science 291 (1987), p.343–360

    Google Scholar 

  7. 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

    Google Scholar 

  8. F. Parisi-Presicce et al.: "Graph rewriting with unification and composition", Lect. Notes in Computer Science 291 (1987), p.496–514

    Google Scholar 

  9. E.G. Wagner: "A categorical treatment of pre-and post-conditions", Theoretical Computer Science 53 (1987), p.3–24

    Article  Google Scholar 

  10. "The programming language Ada", Lect. Notes in Computer Science 155 (1983)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, University of Erlangen-Nuernberg, Martensstr.3, D-8520, Erlangen

    H. J. Schneider

Authors
  1. H. J. Schneider
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Manfred Nagl

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation