Adhesive high-level replacement systems: A new categorical framework for graph transformation

Fundamenta Informaticae

Volumn 74, Issue 1, 2006, Pages 1-29

  Ehrig, Hartmut ^a   Padberg, Julia ^a   Prange, Ulrike ^a   Habel, Annegret ^b  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b UNIVERSITY OF OLDENBURG   (Germany)

Author keywords

Adhesive categories; Adhesive HLR categories; Critical Pair Lemma; Graph transformation; High level replacement systems; Local confluence of transformations

Indexed keywords

MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS;

ADHESIVE CATEGORIES; CRITICAL PAIR LEMMA; GRAPH TRANSFORMATION; HIGH-LEVEL REPLACEMENT SYSTEMS;

GRAPH THEORY;

EID: 37849185656     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (29)

1. Baader, F., Nipkow, T.: Term Rewriting and All That, Cambridge University Press, 1998.
2. Brown, R., Janelidze, G.: Van Kampen Theorems for Categories of Covering Morphisms in Lextensive Categories, Journal of Pure and Applied Algebra, 119, 1997, 255-263.
3. Corradini, A., Ehrig, H., Heckel, R., Löwe, M., Montanari, U., Rossi, F.: Algebraic Approaches to Graph Transformation I : Basic Concepts and Double Pushout Approach, in: Handbook of Graph Grammars and Computing by Graph Transformation, Volume 1: Foundations (G. Rozenberg, Ed.), chapter 3, World Scientific, 1997.
4. Corradini, A., Gadducci, F.: On Term Graphs as an Adhesive Category, Workshop Termgraph 2004, ENTCS, Elsevier, 2004.
5. Ehrig, H.: Introduction to the Algebraic Theory of Graph Grammars (A Survey), in: Graph Grammars and their Application to Computer Science and Biology, vol. 73 of LNCS, Springer, 1979, 1-69.
6. Ehrig, H.: Bigraphs meet Double Pushouts, EATCS Bulletin No. 78, 2002, 72-85.
7. Ehrig, H., Ehrig, K., Habel, A., Pennemann, K.: Theory of Constraints and Application Conditions: From Graphs to High-Level Structures, Fundamenta Informaticae, 2005, this issue.
8. Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamental Theory for Typed Attributed Graphs and Graph Transformation, Fundamenta Informaticae, 2005, this issue.
9. Ehrig, H., Gajewsky, M., Parisi-Presicce, F.: High-Level Replacement Systems with Applications to Algebraic Specifications and Petri Nets, in: Handbook of Graph Grammars and Computing by Graph Transformations, Volume 3: Concurrency, Parallelism, and Distribution (G. Rozenberg, U. Montanari, H. Ehrig, H.-J. Kreowski, Eds.), chapter 6, World Scientific, 1999, 341-400.
10. Ehrig, H., Habel, A., Kreowski, H.-J., Parisi-Presicce, F.: Parallelism and Concurrency in High-Level Replacement Systems, Math. Struct. in Comp. Science, 1, 1991, 361-404.
11. Ehrig, H., Habel, A., Padberg, J., Prange, U.: Adhesive High-Level Replacement Categories and Systems, in: Proceedings of ICGT 2004 (H. Ehrig, G. Engels, F. Parisi-Presicce, G. Rozenberg, Eds.), vol. 3256 of LNCS, Springer, 2004, 144-160.
12. Ehrig, H., König, B.: Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting, in: Proc. FOSSACS 2004, vol. 2987 of LNCS, Springer, 2004, 151-166.
13. Ehrig, H., Orejas, F., Braatz, B., Klein, M., Piirainen, M.: A Generic Component Concept for System Modeling, in: Proc. FASE 2002, vol. 2306 of LNCS, Springer, 2002, 33-48.
14. Ehrig, H., Orejas, F., Braatz, B., Klein, M., Piirainen, M.: A Component Framework for System Modeling Based on High-Level Replacement Systems, Software and Systems Modeling 3(2), 2004, 114-134.
15. Ehrig, H., Prange, U.: Weak Adhesive High-Level Replacement Categories and Systems: A Unifying Framework for Graph and Petri Net Transformations, in: Algebra, Meaning and Computation, LNCS, Springer, 2006, To appear.
16. Ehrig, H., Prange, U., Taentzer, G.: Fundamental Theory for Typed Attributed Graph Transformation, in: Proceedings of ICGT 2004 (H. Ehrig, G. Engels, F. Parisi-Presicce, G. Rozenberg, Eds.), vol. 3256 of LNCS, Springer, 2004, 161-177.
17. Heckel, R., Küster, J., Taentzer, G.: Confluence of Typed Attributed Graph Transformation, in: Proc. ICGT 2002, vol. 2505 of LNCS, Springer, 2002, 161-176.
18. Lack, S., Sobociński, P.: Adhesive Categories, in: Proc. of FOSSACS'04, vol. 2987 of LNCS, Springer, 2004, 273-288.
19. Lack, S., Sobociński, P.: Adhesive and Quasiadhesive Categories, Theoretical Informatics and Applications, 39(3), 2005, 511-546.
20. Lambek, J., Scott, P.: Introduction to Higher Order Categorical Logic, Cambridge University Press, 1986.
21. Leifer, J., Milner, R.: Deriving Bisimulation Congruences for Reactive Systems, in: Proc. CONCUR 2000, vol. 1877 of LNCS, Springer, 2000, 243-258.
22. Löwe, M., Korff, M., Wagner, A.: An Algebraic Framework for the Transformation of Attributed Graphs, in: Term Graph Rewriting: Theory and Practice, John Wiley and Sons Ltd., 1993, 185-199.
23. MacLane, S.: Categories for the Working Mathematician, Springer, 1972.
24. Padberg, J., Ehrig, H., Ribeiro, L.: Algebraic High-Level Net Transformation Systems, in: Mathematical Structures in Computer Science Vol 2, 1995, 217-256.
25. Padberg, J., Taentzer, G.: Embedding of Derivations in High-Level Replacement Systems, Technical Report 1993/9, TU Berlin, 1993.
26. Plump, D.: Hypergraph Rewriting: Critical Pairs and Undecidability of Confluence, in: Term Graph Rewriting: Theory and Practice (M. Sleep, M. Plasmeijer, M. van Eekelen, Eds.), chapter 15, John Wiley & Sons Ltd, 1993, 201-213.
27. Prange, U.: Confluence of Adhesive HLR Systems with Applications to Typed Attributed Graph Transformation Systems. Diploma Thesis, Technical Report 2004/22, TU Berlin, 2004.
28. Sassone, V., Sobociński, P.: Deriving Bisimulation Congruences: 2-Categories vs Precategories, in: Proc. FOSSACS 2003, vol. 2620 of LNCS, Springer, 2003, 409-424.
29. Sobociński, P.: Deriving Process Congruences from Reaction Rules, Ph.D. Thesis, BRICS Dissertation Series, 2004.