Abstract
The goal of this paper is the generalization of embedding and confluence results for graph transformation systems to transformation systems with negative application conditions (NACs). These conditions restrict the application of a rule by expressing that a specific structure must not be present before or after applying the rule to a certain context. Such a condition influences each rule application and transformation and therefore changes significantly the properties of the transformation system. This behavior modification is reflected by the generalization of the Embedding Theorem and the Critical Pair Lemma or Local Confluence Theorem, formulated already for graph transformation systems without negative application conditions. The results hold for adhesive high-level replacement systems with NACs and are formulated in this paper for the instantiation to double-pushout graph transformation systems with NACs. All constructions and results are explained on a running example.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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)
Bottoni, 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)
Huet, G.: Confluent reductions: Abstract properties and applications to term rewriting systems. JACM 27(4), 797–821 (1980)
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)
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)
Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation. EATCS Monographs in Theoretical Computer Science. Springer, Heidelberg (2006)
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)
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)
Lambers, L.: Adhesive high-level replacement systems with negative application conditions. Technical report, Technische Universität Berlin (2007), http://iv.tu-berlin.de/TechnBerichte/2007/2007-14.pdf
Habel, A., Heckel, R., Taentzer, G.: Graph grammars with negative application conditions 26, 287–313 (1996)
Corradini, A., Montanari, U., Rossi, F., Ehrig, H., Heckel, R., Löwe, M.: Algebraic Approaches to Graph Transformation I: 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)
Taentzer, G.: AGG: A Graph Transformation Environment for Modeling and Validation of Software. In: Pfaltz, J.L., Nagl, M., Böhlen, B. (eds.) AGTIVE 2003. LNCS, vol. 3062, pp. 446–456. Springer, Heidelberg (2004)
Ehrig, H., Ehrig, K., Habel, A., Pennemann, K.H.: Constraints and application conditions: From 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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lambers, L., Ehrig, H., Prange, U., Orejas, F. (2008). Embedding and Confluence of Graph Transformations with Negative Application Conditions. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds) Graph Transformations. ICGT 2008. Lecture Notes in Computer Science, vol 5214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87405-8_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-87405-8_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87404-1
Online ISBN: 978-3-540-87405-8
eBook Packages: Computer ScienceComputer Science (R0)