Graph transformation units with interleaving semantics

Formal Aspects of Computing

Volumn 11, Issue 6, 1999, Pages 690-723

  Kreowski, Hans Jörg ^a   Kuske, Sabine ^a  

^a UNIVERSITY OF BREMEN   (Germany)

Author keywords

Formal methods; Graph transformation; Interleaving semantics; Structuring; Transformation unit

Indexed keywords

EID: 0043284482     PISSN: 09345043     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001659970005     Document Type: Article

References (34)

1. Marc Andries, Gregor Engels, Annegret Habel, Berthold Hoffmann, Hans-Jörg Kreowski, Sabine Kuske, Detlef Plump, Andy Schürr, and Gabriele Taentzer. Graph transformation for specification and programming. Science of Computer Programming, 34(1):1-54, 1999.
2. Horst Bunke. Programmed graph grammars. In Volker Claus, Hartmut Ehrig, and Grzegorz Rozenberg, editors, Proc. Graph Grammars and Their Application to Computer Science and Biology, volume 73 of Lecture Notes in Computer Science, pages 155-166, 1979.
3. Bruno Courcelle. Graph rewriting: An algebraic and logical approach. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 193-242. Elsevier, Amsterdam, 1990.
4. Jürgen Dassow and Gheorghe Pǎun. Regulated Rewriting in Formal Language Theory, volume 18 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1989.
5. Hartmut Ehrig and Gregor Engels. Pragmatic and semantic aspects of a module concept for graph transformation systems. In Janice E. Cuny, Hartmut Ehrig, Gregor Engels, and Grzegorz Rozenberg, editors, Proc. Graph Grammars and Their Application to Computer Science, volume 1073 of Lecture Notes in Computer Science, pages 137-154, 1996.
6. Hartmut Ehrig, Gregor Engels, Hans-Jörg Kreowski, and Grzegorz Rozenberg, editors. Handbook of Graph Grammars and Computing by Graph Transformation, Vol. 2: Applications, Languages and Tools. World Scientific, Singapore, 1999.
7. Hartmut Ehrig and Annegret Habel. Graph grammars with application conditions. In Grzegorz Rozenberg and Arto Salomaa, editors, The Book of L, pages 87-100. Springer-Verlag, Berlin, 1986.
8. Hartmut Ehrig. Introduction to the algebraic theory of graph grammars. In Volker Claus, Hartmut Ehrig, and Grzegorz Rozenberg, editors, Proc. Graph Grammars and Their Application to Computer Science and Biology, volume 73 of Lecture Notes in Computer Science, pages 1-69, 1979.
9. Hartmut Ehrig, Hans-Jörg Kreowski, Ugo Montanari, and Grzegorz Rozenberg, editors. Handhook of Graph Grammars and Computing by Graph Transformation, Vol. 3: Concurrency. Parallelism, and Distribution. World Scientific, Singapore, 1999.
10. John R. W. Glauert, J. Richard Kennaway, and M. Ronan Sleep. DACTL: An experimental graph rewriting language. In Hartmut Ehrig, Hans-Jörg Kreowski, and Grzegorz Rozenberg, editors, Proc. Graph Grammars and Their Application to Computer Science, volume 532 of Lecture Notes in Computer Science, pages 378-395, 1991.
11. Annegret Habel. Hyperedge Replacement: Grammars and Languages, volume 643 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1992.
12. Annegret Habel, Reiko Heckel, and Gabriele Taentzer. Graph grammars with negative application conditions. Fundamenta Informaticae, 26(3,4):287-313, 1996.
13. ed: An interactive tool for developing graph grammars. In Hartmut Ehrig, Hans-Jörg Kreowski, and Grzegorz Rozenberg, editors, Proc. Graph Grammars and Their Application to Computer Science, volume 532 of Lecture Notes in Computer Science, pages 61-65, 1991.
14. Dirk Janssens and Grzegorz Rozenberg. On the structure of node-label-controlled graph languages. Information Sciences, 20:191-216, 1980.
15. Hans-Jörg Kreowski and Sabine Kuske. On the interleaving semantics of transformation units - a step into GRACE. In Janice E. Cuny, Hartmut Ehrig, Gregor Engels, and Grzegorz Rozenberg, editors, Proc. Graph Grammars and Their Application to Computer Science, volume 1073 of Lecture Notes in Computer Science, pages 89-108, 1996.
16. Hans-Jörg Kreowski and Sabine Kuske. Graph transformation units and modules. In Ehrig et al. [EEK99], pages 607-638.
17. Hans-Jörg Kreowski, Sabine Kuske, and Andy Schürr. Nested graph transformation units. International Journal on Software Engineering and Knowledge Engineering, 7(4):479-502, 1997.
18. Hans-Jörg Kreowski and Grzegorz Rozenberg. On structured graph grammars, I and II. Information Sciences, 52:185-210 and 221-246, 1990.
19. Hans-Jörg Kreowski. Five facets of hyperedge replacement beyond context-freeness. In Zoltán Ésik, editor, Proc. Fundamentals of Computation Theory, volume 710 of Lecture Notes in Computer Science, pages 69-86, 1993.
20. Michael Löwe and Martin Beyer. AGG - an implementation of algebraic graph rewriting. In Claude Kirchner, editor, Proc. Rewriting Techniques and Applications, volume 690 of Lecture Notes in Computer Science, pages 451-456, 1993.
21. Thomas Lengauer. VLSI theory. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, volume A. Elsevier Science Publishers B.V., 1990.
22. Igor Litovsky and Yves Métivier. Computing with graph rewriting systems with priorities. Theoretical Computer Science, 115:191-224, 1993.
23. Michael Löwe. Algebraic approach to single-pushout graph transformation. Theoretical Computer Science, 109:181-224, 1993.
24. Andrea Maggiolo-Schettini and Józef Winkowski. Programmed derivations of relational structures. In Hartmut Ehrig, Hans-Jörg Kreowski, and Grzegorz Rozenberg, editors, Proc. Graph Grammars and Their Application to Computer Science, volume 532 of Lecture Notes in Computer Science, pages 582-598, 1991.
25. Andrea Maggiolo-Schettini and Jozef Winkowski. A kernel language for programmed rewriting of (hyper)graphs. Acta Informatica, 33(6):523-546, 1996.
26. Manfred Nagl. Graph-Grammatiken: Theorie. Anwendungen. Implementierungen. Vieweg, Braunschweig, 1979.
27. Grzegorz Rozenberg, editor. Handbook of Graph Grammars and Computing by Graph Transformation, Vol. 1: Foundations. World Scientific, Singapore, 1997.
28. Andy Schürr. Operationales Spezifizieren mit programmierten Graphersetzungssystemen: formale Definitionen. Anwendungsbeispiele und Werkzeugunterstützung. PhD thesis, Rheinisch-Westfälische Technische Hochschule Aachen, 1991.
29. Andy Schürr. PROGRES: A VHL-language based on graph grammars. In Hartmut Ehrig, Hans-Jörg Kreowski, and Grzegorz Rozenberg, editors, Proc. Graph Grammars and Their Application to Computer Science, volume 532 of Lecture Notes in Computer Science, pages 641-659, 1991.
30. Andy Schürr. Programmed graph transformations and graph transformation units in GRACE. In Janice E. Cuny, Hartmut Ehrig, Gregor Engels, and Grzegorz Rozenberg, editors, Proc. Graph Grammars and Their Application to Computer Science, volume 1073 of Lecture Notes in Computer Science, pages 122-136, 1996.
31. Andy Schürr and Albert Zündorf. Nondeterministic control structures for graph rewriting systems. In G. Schmidt and Rudolf Berghammer, editors, Proc. Graph-Theoretic Concepts in Computer Science, volume 570 of Lecture Notes in Computer Science, pages 48-62, 1991.
32. Gabriele Taentzer and Martin Beyer. Amalgamated graph transformation systems and their use for specifying AGG - an algebraic graph grammar system. In Hans-Jürgen Schneider and Hartmut Ehrig, editors, Proc. Graph Transformations in Computer Science, volume 776 of Lecture Notes in Computer Science, pages 380-394, 1994.
33. Gabriele Taentzer and Andy Schürr. DIEGO, another step towards a module concept for graph transformation systems. In A. Corradini and U. Montanari, editors, SEGRAGRA'95. Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation, volume 2 of Electronic Notes in Theoretical Computer Science. Elsevier, 1995.
34. Jeffrey D. Ullman. Computational Aspects of VLSI. Computer Science Press, Rockville, MD, 1984.