More about control conditions for transformation units

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1764, Issue , 2000, Pages 323-337

  Kuske, Sabine ^a  

^a UNIVERSITY OF BREMEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS;

BINARY RELATION; EXPRESSIVE POWER; GRAPH TRANSFORMATION; GRAPH TRANSFORMATION SYSTEM; INVERTIBILITY; NON DETERMINISM; REGULAR EXPRESSIONS; TRANSFORMATION UNITS;

GRAPH THEORY;

EID: 84949958294     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-46464-8_23     Document Type: Conference Paper

References (21)

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. Andrea Corradini, Hartmut Ehrig, Reiko Heckel, Michael Löwe, Ugo Montanari, and Francesca Rossi. Algebraic approaches to graph transformation part I: Basic concepts and double pushout approach. In Rozenberg [Roz97].
4. Frank Drewes, Annegret Habel, and Hans-Jörg Kreowski. Hyperedge replacement graph grammars. In Rozenberg [Roz97], pages 95-162.
5. 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.
6. Hartmut Ehrig, Gregor Engels, Hans-Jörg Kreowski, and Grzegorz Rozenberg, editors. Handbook of Graph Grammars and Computing by Graph Transformation, Vol. II: Applications, Languages and Tools. World Scientific, Singapore, 1999. To appear.
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, Reiko Heckel, Martin Korff, Michael Löwe, Leila Ribeiro, Annika Wagner, and Andrea Corradini. Algebraic approaches to graph transformation II: Single pushout approach and comparison with double pushout approach. In Rozenberg[Roz97], pages 247-312.
9. Joost Engelfriet and Grzegorz Rozenberg. Node replacement graph grammars. In Rozenberg [Roz97], pages 1-94.
10. Reiko Heckel, Gregor Engels, Hartmut Ehrig, and Gabriele Taentzer. Classification and comparison of modul concepts for graph transformation systems. In Ehriget al. [EEKR99]. To appear.
11. Annegret Habel, Reiko Heckel, and Gabriele Taentzer. Graph grammars with negative application conditions. Fundamenta Informaticae, XXVI(3,4):287-313, 1996.
12. Hans-Jörg Kreowski and Sabine Kuske. On the interleavingsem antics 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.
13. Hans-Jörg Kreowski and Sabine Kuske. Graph transformation units and modules. In Ehrige t al. [EEKR99]. To appear.
14. 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. 323, 325, 333, 335
15. Igor Litovsky and Yves Métivier. Computingwit h graph rewriting systems with priorities. Theoretical Computer Science, 115:191-224, 1993.
16. Andrea Maggiolo-Schettini and Józef Winkowski. A kernel language for programmed rewriting of (hyper) graphs. Acta Informatica, 33(6):523-546, 1996.
17. Manfred Nagl. Graph-Grammatiken: Theorie, Anwendungen, Implementierungen. Vieweg, Braunschweig, 1979.
18. Grzegorz Rozenberg, editor. Handbook of Graph Grammars and Computing by Graph Transformation, Vol. I: Foundations. World Scientific, Singapore, 1997.
19. Hans-Jürgen Schneider. Syntax-directed description of incremental compilers. In D. Siefkes, editor, GI—4. Jahrestagung, volume 26 of Lecture Notes in Computer Science, pages 192-201, 1975.
20. Andy Schürr. Programmed graph replacement systems. In Rozenberg [Roz97], pages 479-546.
21. Gabriele Taentzer, C. Ermel, and Michael Rudolf. The AGG-approach: Language and tool environment. In Ehrig et al. [EEKR99]. To appear.