Constraints and application conditions: From graphs to high-level structures

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

Volumn 3256, Issue , 2004, Pages 287-303

  Ehrig, Hartmut ^a   Ehrig, Karsten ^a   Habel, Annegret ^b   Pennemann, Karl Heinz ^b  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b UNIVERSITY OF OLDENBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LANGUAGES;

ADHESIVE CATEGORIES; APPLICATION AREA; GRAPH CONSTRAINTS; GRAPH GRAMMAR; GRAPH TRANSFORMATION; HIGH LEVEL REPLACEMENT SYSTEMS; HIGH-LEVEL STRUCTURE; TRANSFORMATION SYSTEMS;

GRAPH THEORY;

EID: 34247347694     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30203-2_21     Document Type: Article

References (12)

1. Paolo Bottoni, Manuel Koch, Manuel Parisi-Presicce, and Gabriele Taentzer. Consistency checking and visualization of ocl constraints. In UML 2000, volume 1939 of Lecture Notes in Computer Science, pages 294-308. Springer-Verlag, 2000.
2. Andrea Corradini, Ugo Montanari, Prancesca Rossi, Hartmut Ehrig, Reiko Heckel, and Michael Löwe. Algebraic approaches to graph transformation. Part I: Basic concepts and double pushout approach. In Handbook of Graph Grammars and Computing by Graph Transformation, volume 1, chapter 3, pages 163-245. World Scientific, 1997.
3. Hartmut Ehrig. Introduction to the algebraic theory of graph grammars. In GraphGrammars and Their Application to Computer Science and Biology, volume 73 of Lecture Notes in Computer Science, pages 1-69. Springer-Verlag, 1979.
4. Hartmut Ehrig and Annegret Habel. Graph grammars with application conditions. In G. Rozenberg and A. Salomaa, editors, The Book of L, pages 87-100. SpringerVerlag, Berlin, 1986.
5. Hartmut Ehrig, Annegret Habel, Hans-Jörg Kreowski, and Francesco ParisiPresicce. Parallelism and concurrency in high level replacement systems. Mathematical Structures in Computer Science, 1:361-404, 1991.
6. Hartmut Ehrig, Annegret Habel, Julia Padberg, and Ulrike Prange. Adhesive highlevel replacement categories and systems. In Graph Transformation (ICGT'04), Lecture Notes in Computer Science. Springer-Verlag, 2004.
7. Hartmut Ehrig, Ulrike Prange, and Gabriele Taentzer. Fundamental theory of typed attributed graph transformation. In Graph Transformation (ICGT'04), Lecture Notes in Computer Science. Springer-Verlag, 2004.
8. Annegret Habel, Reiko Heckel, and Gabriele Taentzer. Graph grammars with negative application conditions. Fundamenta Informaticae, 26:287-313, 1996.
9. Reiko Heckel and Annika Wagner. Ensuring consistency of conditional graph grammars - a constructive approach. In SEGRAGRA 95, volume 2 of Electronic Notes in Theoretical Computer Science, pages 95-104, 1995.
10. Manuel Koch and Francesco Parisi-Presicce. Describing policies with graph constraints and rules. In Graph Transformation (ICGT 2002), volume 2505 of Lecture Notes in Computer Science, pages 223-238. Springer-Verlag, 2002.
11. Stephen Lack and Pawel Sobociński. Adhesive categories. In Proc. of Foundations of Software Science and Computation Structures (FOSSACS'04), volume 2987 of Lecture Notes in Computer Science, pages 273-288. Springer-Verlag, 2004.
12. Detlef Plump. Hypergraph rewriting: Critical pairs and undecidability of confluence. In Term Graph Rewriting: Theory and Practice, pages 201-213. John Wiley, New York, 1993.