Embedding and Confluence of Graph Transformations with Negative Application Conditions

Authors:
Leen Lambers;Hartmut Ehrig;Ulrike Prange;Fernando Orejas
Affiliations:
Institute for Software Engineering and Theoretical Informatics, Technical University, Berlin, Germany;Institute for Software Engineering and Theoretical Informatics, Technical University, Berlin, Germany;Institute for Software Engineering and Theoretical Informatics, Technical University, Berlin, Germany;Department L.S.I, Technical University of Catalonia, Spain
Venue:
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Year:
2008

Citing 8
Cited 4

Hypergraph rewriting: critical pairs and undecidability of confluence

Term graph rewriting
Graph grammars with negative application conditions

Fundamenta Informaticae - Special issue on graph transformations
Algebraic approaches to graph transformation. Part I: basic concepts and double pushout approach

Handbook of graph grammars and computing by graph transformation
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems

Journal of the ACM (JACM)
Efficient Parsing of Visual Languages based on Critical Pair Analysis and Contextual Layered Graph Transformation

VL '00 Proceedings of the 2000 IEEE International Symposium on Visual Languages (VL'00)
Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series)

Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series)
Conflict detection for graph transformation with negative application conditions

ICGT'06 Proceedings of the Third international conference on Graph Transformations
Confluence of graph transformation revisited

Processes, Terms and Cycles

Local confluence for rules with nested application conditions

ICGT'10 Proceedings of the 5th international conference on Graph transformations
Attributed graph transformation with inheritance: Efficient conflict detection and local confluence analysis using abstract critical pairs

Theoretical Computer Science
A visual token-based formalization of BPMN 2.0 based on in-place transformations

Information and Software Technology
Bridging the gap between formal semantics and implementation of triple graph grammars

Software and Systems Modeling (SoSyM)

Quantified Score

Hi-index	0.00

Visualization

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.