Embedding and confluence of graph transformations with negative application conditions

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

Volumn 5214 LNCS, Issue , 2008, Pages 162-177

  Lambers, Leen ^a   Ehrig, Hartmut ^a   Prange, Ulrike ^a   Orejas, Fernando ^b  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATIONS; THEOREM PROVING;

EMBEDDING THEOREMS; GRAPH TRANSFORMATION SYSTEMS; NEGATIVE APPLICATION CONDITIONS; OF GRAPHS; REPLACEMENT SYSTEMS; SPECIFIC STRUCTURES; TRANSFORMATION SYSTEMS;

GRAPH THEORY;

EID: 56449127818     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87405-8_12     Document Type: Conference Paper

References (13)

1. Taentzer, G., Ehrig, K., Guerra, E., de Lara, J., Lengyel, L., Levendovsky, T., Prange, U., Varro, D., Varro-Gyapay, S.: Model Transformation by Graph Transformation: A Comparative Study. In: Proc, Workshop Model Transformation in Practice, Montego Bay, Jamaica (October 2005)
2. Bottom, P., Schürr. A., Taentzer, G.: Efficient Parsing of Visual Languages based on Critical Pair Analysis and Contextual Layered Graph Transformation. In: Proc. IEEE Symposium on Visual Languages, Long version available as technical report SI-2000-06, University of Rom (September 2000)
3. Huet, G.: Confluent reductions: Abstract properties and applications to term rewriting systems. JACM 27(4), 797-821 (1980)
4. Plump, D.: Hypergraph Rewriting: Critical Pairs and Undecidability of Confluence. In: Sleep, M., Plasmeijer, M., van Eekelen, M.C. (eds.) Term Graph Rewriting, pp. 201-214. Wiley, Chichester (1993)
5. Plump, D.: Confluence of graph transformation revisited. In: Middeldorp, A., van Oostrom, V., van Raamsdonk, F., de Vrijer, R. (eds.) Processes, Terms and Cycles: Steps on the Road to Infinity. LNCS, vol. 3838, pp. 280-308. Springer, Heidelberg (2005)
6. Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation. EATCS Monographs in Theoretical Computer Science. Springer, Heidelberg (2006)
7. Lambers, L., Ehrig, H., Orejas, F., Prange, U.: Parallelism and Concurrency in Adhesive High-Level Replacement Systems with Negative Application Conditions. In: Ehrig, H., Pfalzgraf, J., Prange, U. (eds.) CC 2007. Elsevier, Amsterdam (to appear, 2008)
8. Lambers, L., Ehrig, H., Orejas, F.: Conflict Detection for Graph Transformation with Negative Application Conditions. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozenberg, G. (eds.) ICGT 2006. LNCS, vol. 4178, pp. 61-76. Springer, Heidelberg (2006)
9. Lambers, L.: Adhesive high-level replacement systems with negative application conditions. Technical report, Technische Universitat Berlin (2007), http://iv.tu-berlin.de/TechnBerichte/2007/2007-14.pdf
10. Habel, A., Heckel, R., Taentzer, G.: Graph grammars with negative application conditions 26, 287-313 (1996)
11. Corradini, A., Montanari, U., Rossi, F., Ehrig, H., Heckel, R., Löwe, M.: Algebraic Approaches to Graph Transformation 1: Basic Concepts and Double Pushout Approach. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation, Foundations, vol. 1, pp. 163-245. World Scientific, Singapore (1997)
12. Taentzer, G.: AGG: A Graph Transformation Environment for Modeling and Validation of Software. In: Pfaltz, J.L., Nagl, M., Bohlen, B. (eds.) AGTIVE 2003. LNCS, vol. 3062, pp. 446-456. Springer, Heidelberg (2004)
13. Ehrig, H., Ehrig, K., Habel, A., Pennemann, K.H.: Constraints and application conditions: Prom graphs to high-level structures. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, vol. 3256, pp. 287-303. Springer, Heidelberg (2004)