Parallel independence in hierarchical graph transformation

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

Volumn 3256, Issue , 2004, Pages 178-193

  Habel, Annegret ^a   Hoffmann, Berthold ^b  

^a UNIVERSITY OF OLDENBURG   (Germany)

^b UNIVERSITY OF BREMEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

GENERAL STRUCTURES; GRAPH TRANSFORMATION; GRAPH VARIABLES; HIERARCHICAL GRAPHS; HIERARCHICAL STRUCTURES; TERM REWRITING; TRANSFORMATION RULES; TRANSFORMATION SEQUENCES;

GRAPH THEORY;

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

References (17)

1. Drevves, F., Hoffmann, B., Plump, D.: Hierarchical graph transformation. Journal of Computer and System Sciences 64 (2002) 249-283
2. Hoffmann, B.: Shapely hierarchical graph transformation. In: Proc. IEEE Symposia on Human-Centric Computing Languages and Environments. IEEE Computer Press (2001) 30-37
3. Rozenberg, G., ed.: Handbook of Graph Grammars and Computing by Graph Transformation. Volume 1: Foundations. World Scientific (1997)
4. Ehrig, H., Engels, G., Kreowski, H.J., Rozenberg, G., eds.: Handbook of Graph Grammars and Computing by Graph Transformation. Volume 2: Applications, Languages and Tools. World Scientific (1999)
5. Ehrig, H., Kreowski, H.J., Montanari, U., Rozenberg, G., eds.: Handbook of Graph Grammars and Computing by Graph Transformation. Volume 3: Concurrency, Parallelism, and Distribution. World Scientific (1999)
6. Busatto, G.: An Abstract Model of Hierarchical Graphs and Hierarchical Graph Transformation. PhD thesis, Universität-Gesamthochschule Paderborn (2002)
7. Ehrig, H.: 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., Springer-Verlag (1979) 1-69
8. Engels, G., Heckel, R.: Graph transformation as a conceptual and formal framework for system modelling and evolution. In: Automata, Languages, and Programming (ICALP 2000). Volume 1853 of Lecture Notes in Computer Science., SpringerVerlag (2000) 127-150
9. Plump, D., Habel, A.: Graph unification and matching. In: Graph Grammars and Their Application to Computer Science. Volume 1073 of Lecture Notes in Computer Science., Springer-Verlag (1996) 75-89
10. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge, UK (1998)
11. Hoffmann, B.: Abstraction and control for shapely nested graph transformation. Fundamenta Informaticae 58 (1) (2003) 39-65
12. Ehrig, H., Kreowski, H.J.: Parallelism of manipulations in multidimensional information structures. In: Mathematical Foundations of Computer Science. Volume 45 of Lecture Notes in Computer Science., Springer-Verlag (1976) 284-293
13. Ehrig, H, Habel, A., Padberg, J., Prange, U.: Adhesive high-level replacement categories and systems. In: Graph Transformation (ICGT'04). Lecture Notes in Computer Science, Springer-Verlag (2004)
14. Habel, A., Müller, J., Plump, D.: Double-pushout graph transformation revisited. Mathematical Structures in Computer Science 11 (2001) 637-688
15. Ehrig, H., Habel, A., Kreowski, H.J., Parisi-Presicce, F.: Parallelism and concurrency in high level replacement systems. Mathematical Structures in Computer Science 1 (1991) 361-404
16. Plump, D.: Hypergraph rewriting: Critical pairs and undecidability of confluence. In: Term Graph Rewriting: Theory and Practice. John Wiley, New York (1993) 201-213
17. Plump, D.: On termination of graph rewriting. In: Graph-Theoretic Concepts in Computer Science. Volume 1017 of Lecture Notes in Computer Science., SpringerVerlag (1995) 88-100