Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Graph Grammars and Their Application to Computer Science

Graph Grammars 1994: Graph Grammars and Their Application to Computer Science pp 304–320Cite as

Hierarchically distributed graph transformation

  • Concurrency
  • Conference paper
  • First Online:

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

Abstract

Hierarchically distributed graph transformation offers means to model different aspects of open distributed systems very intuitively in a graphical way. The distribution topology as well as local object structures are represented graphically. Distributed actions such as local actions, network activities, communication and synchronization can be described homogeneously using the same method: graph transformation. This new approach to graph transformation follows the lines of algebraic and categorical graph grammars and fits into the framework of double-pushout high-level replacement systems.

This work has been partly supported by the ESPRIT Working Group 7183 “Computing by Graph Transformation (COMPUGRAPH II)”

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. J. Adamek, H. Herrlich, and G. Strecker. Abstract and Concerte Categories. Series in Pure and Applied Mathematics. John Wiley and Sons, 1990.

    Google Scholar 

  2. I. Classen, M. Löwe, S. Wasserroth, and J. Wortmann. Static and dynamic semantics of entity-relationship models based on algebraic methods, to appear in proc. IFIP-Congress and GI-Fachgespräche, Hamburg, 1994.

    Google Scholar 

  3. P. Degano and U. Montanari. A model of distributed systems based on graph rewriting. Journal of the ACM, 34(2):411–449, 1987.

    Google Scholar 

  4. H. Ehrig. Introduction to the algebraic theory of graph grammars. In V. Claus, H. Ehrig, and G. Rozenberg, editors, 1st Graph Grammar Workshop, Lecture Notes in Computer Science 73, pages 1–69. Springer Verlag, 1979.

    Google Scholar 

  5. H. Ehrig, P. Boehm, U. Hummert, and M. Löwe. Distributed parallelism of graph transformation. In 13th Int. Workshop on Graph Theoretic Concepts in Computer Science, LNCS 314, pages 1–19, Berlin, 1988. Springer Verlag.

    Google Scholar 

  6. H. Ehrig, A. Habel, H.-J. Kreowski, and F. Parisi-Presicce. From graph grammars to High Level Replacement Systems. In Ehrig et al. [7], pages 269–291. Lecture Notes in Computer Science 532.

    Google Scholar 

  7. H. Ehrig, H.-J. Kreowski, and G. Rozenberg, editors, 4th International Workshop on Graph Grammars and Their Application to Computer Science. Springer Verlag, 1991. Lecture Notes in Computer Science 532.

    Google Scholar 

  8. H. Ehrig and M. Löwe. Parallel and distributed derivations in the single pushout approach. TCS, 109:123–143, 1993.

    Google Scholar 

  9. S.M. Kaplan, J.P. Loyall, and S.K. Goering. Specifying concurrent languages and systems with δ-grammars. In Ehrig et al. [7], pages 475–489. Lecture Notes in Computer Science 532.

    Google Scholar 

  10. D. Kips and G. Heidenreich. Project flow graphs — a meta-model to support quality assurance in software-engineering, to appear in proc. of IEPM'95, 1995.

    Google Scholar 

  11. M. Korff. Single pushout transformations of equationally defined graph structures with applications to actor systems. In Proc. Graph Grammar Workshop Dagstuhl 93, pages 234–247. Springer Verlag, 1994. Lecture Notes in Computer Science 776.

    Google Scholar 

  12. P. Pepper and M. Wirsing. KORSO: A methodology for the development of correct software, to be published in LNCS, 1995.

    Google Scholar 

  13. G. Schied. Über Graphgrammatiken, eine Spezifikationsmethode für Programmiersprachen und verteilte Regelsysteme. Arbeitsberichte des Institus für mathematische Maschinen und Datenverarbeitung (Informatik), University of Erlangen, 1992.

    Google Scholar 

  14. H.-J. Schneider. On categorical graph grammars integrating structural transformation and operations on labels. TCS, 109:257–274, 1993.

    Google Scholar 

  15. G. Taentzer. Towards synchronous and asynchronous graph transformations. accepted for special issue of Fundamenta Informaticae, 1995.

    Google Scholar 

  16. G. Taentzer and A. Schürr. DIEGO, another step towards a module concept for graph transformation systems. to appear in proc. of SEGRAGRA'95 ” Graph Rewriting and Computation”, published in Electronic Notes of TCS, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Technical University of Berlin, Franklinstr. 28/29, Sekr. FR 6-1, D-10587, Berlin

    Gabriele Taentzer

Authors
  1. Gabriele Taentzer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Janice Cuny Hartmut Ehrig Gregor Engels Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Taentzer, G. (1996). Hierarchically distributed graph transformation. In: Cuny, J., Ehrig, H., Engels, G., Rozenberg, G. (eds) Graph Grammars and Their Application to Computer Science. Graph Grammars 1994. Lecture Notes in Computer Science, vol 1073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61228-9_95

Download citation

  • DOI: https://doi.org/10.1007/3-540-61228-9_95

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61228-5

  • Online ISBN: 978-3-540-68388-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation