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 89–106Cite as

On the interleaving semantics of transformation units — A step into GRACE

  • Specification and Semantics
  • Conference paper
  • First Online:

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

Abstract

The aim of the paper is to introduce the notion of a transformation unit together with its interleaving semantics and to study it as a means of constructing large graph transformation systems from small ones in a structured and systematic way. A transformation unit comprises a set of rules, descriptions of initial and terminal graphs, and a control condition. Moreover, it may import other transformation units for structuring purposes. Its semantics is a binary relation between initial and terminal graphs which is given by interleaving sequences. As a generalization of ordinary derivations, an interleaving sequence consists of direct derivation steps interleaved with calls of imported transformation units. It must obey the control condition and may be seen as a kind of structured derivation. The introduced framework is independent of a particular graph transformation approach and, therefore, it may enhance the usefulness of graph transformations in many contexts.

This work has been supported by COMPUGRAPH II, ESPRIT Basic Research Working Group 7183.

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. H. Bunke. Programmed graph grammars. In Claus et al. [CER79], 155–166.

    Google Scholar 

  2. V. Claus, H. Ehrig, G. Rozenberg, eds. Graph Grammars and Their Application to Computer Science and Biology, Lecture Notes in Computer Science 73, 1979.

    Google Scholar 

  3. B. Courcelle. Graph rewriting: An algebraic and logical approach. In J. van Leeuwen, ed., Handbook of Theoretical Computer Science, volume Vol. B., 193–242. Elsevier, Amsterdam, 1990.

    Google Scholar 

  4. J. Dassow, G. Paun. Regulated Rewriting in Formal Language Theory, volume 18 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1989.

    Google Scholar 

  5. H. Ehrig. Introduction to the algebraic theory of graph grammars. In Claus et al. [CER79], 1–69.

    Google Scholar 

  6. H. Ehrig, G. Engels. Towards a module concept for graph transformation systems. Technical Report 93-34, Leiden, 1993.

    Google Scholar 

  7. H. Ehrig, A. Habel. Graph grammars with application conditions. In G. Rozenberg, A. Salomaa, eds., The Book of L, 87–100. Springer-Verlag, Berlin, 1986.

    Google Scholar 

  8. H. Ehrig, H.-J. Kreowski, G. Rozenberg, eds. Graph Grammars and Their Application to Computer Science, Lecture Notes in Computer Science 532, 1991.

    Google Scholar 

  9. H. Ehrig, M. Nagl, G. Rozenberg, eds. Graph-Grammars and Their Application to Computer Science, Lecture Notes in Computer Science 153, 1983.

    Google Scholar 

  10. H. Ehrig, M. Nagl, G. Rozenberg, A. Rosenfeld, eds. Graph-Grammars and Their Application to Computer Science, Lecture Notes in Computer Science 291, 1987.

    Google Scholar 

  11. J.R.W. Glauert, J.R. Kennaway, M.R. Sleep. Dactl: An experimental graph rewriting language. In Ehrig et al. [EKR91], 378–395.

    Google Scholar 

  12. A. Habel. Hyperedge replacement: Grammars and languages. Lecture Notes in Computer Science 643, 1992.

    Google Scholar 

  13. A. Habel, R. Heckel, G. Taentzer. Graph grammars with negative application conditions. Fundamenta Informaticae, 1995. To appear.

    Google Scholar 

  14. M. Himsolt. Graph-Ed: An interactive tool for developing graph grammars. In Ehrig et al. [EKR91], 61–65.

    Google Scholar 

  15. D. Janssens, G. Rozenberg. On the structure of node-label-controlled graph languages. Information Sciences 20, 191–216, 1980.

    Google Scholar 

  16. H.-J. Kreowski. Five facets of hyperedge replacement beyond contextfreeness. In Z. Ésik, ed., Fundamentals of Computation Theory, Lecture Notes in Computer Science 710, 69–86, 1993.

    Google Scholar 

  17. H.-J. Kreowski. Graph grammars for software specification and programming: An eulogy in praise of GRACE. In Rosselló and Valiente [RV95], 55–61.

    Google Scholar 

  18. H.-J. Kreowski, G. Rozenberg. On structured graph grammars, I and II. Information Sciences 52, 185–210 and 221–246, 1990.

    Google Scholar 

  19. S. Kuske. Semantic aspects of the graph and rule centered language GRACE. In Rosselló and Valiente [RV95], 63–69.

    Google Scholar 

  20. T. Lengauer. VLSI theory. In J. van Leeuwen, ed., Handbook of Theoretical Computer Science, volume A. Elsevier Science Publishers B.V., 1990.

    Google Scholar 

  21. I. Litovsky, Y. Métivier. Computing with graph rewriting systems with priorities. Theoretical Computer Science 115, 191–224, 1993.

    Google Scholar 

  22. M. Löwe. Algebraic approach to single-pushout graph transformation. Theoretical Computer Science 109, 181–224, 1993.

    Google Scholar 

  23. M. Löwe, M. Beyer. AGG — an implementation of algebraic graph rewriting. In C. Kirchner, ed., Rewriting Techniques and Applications, Lecture Notes in Computer Science 690, 451–456, 1993.

    Google Scholar 

  24. A. Maggiolo-Schettini, J. Winkowski. Programmed derivations of relational structures. In Ehrig et al. [EKR91], 582–598.

    Google Scholar 

  25. M. Nagl. Graph-Grammatiken: Theorie, Anwendungen, Implementierungen. Vieweg, Braunschweig, 1979.

    Google Scholar 

  26. F. Rosselló, G. Valiente, eds. Proceedings Colloquium on Graph Transformation and its Application in Computer Science, Technical Report UIBDMI-B-19. University of the Balearic Islands, 1995.

    Google Scholar 

  27. H.J. Schneider, H. Ehrig, eds. Graph Transformations in Computer Science, Lecture Notes in Computer Science 776, 1993.

    Google Scholar 

  28. A. Schürr. Operationales Spezifizieren mit programmierten Graphersetzungssystemen. Deutscher Universitäts-Verlag, Wiesbaden, 1991.

    Google Scholar 

  29. A. Schürr. PROGRES: A VHL-language based on graph grammars. In Ehrig et al. [EKR91], 641–659.

    Google Scholar 

  30. A. Schürr. Programmed graph transformations and graph transformation units in GRACE, 1995. This volume.

    Google Scholar 

  31. A. Schürr, A. Zündorf. Nondeterministic control structures for graph rewriting systems. In G. Schmidt, R. Berghammer, eds., Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science 570, 48–62, 1991.

    Google Scholar 

  32. G. Taentzer, M. Beyer. Amalgamated graph transformation systems and their use for specifying AGG — an algebraic graph grammar system. In Schneider and Ehrig [SE93], 380–394.

    Google Scholar 

  33. G. Taentzer, A. Schürr. DIEGO, another step towards a module concept for graph transformation systems. Electronic Notes in Theoretical Computer Science, 1995. To appear.

    Google Scholar 

  34. J.D. Ullman. Computational Aspects of VLSI. Computer Science Press, Rockville, MD, 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universität Bremen, , Fachbereich 3, Postfach 33 04 40, D-28334, Bremen

    Hans-Jörg Kreowski & Sabine Kuske

Authors
  1. Hans-Jörg Kreowski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sabine Kuske
    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

Kreowski, HJ., Kuske, S. (1996). On the interleaving semantics of transformation units — A step into GRACE. 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_81

Download citation

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

  • 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