# An Algorithm for the Critical Pair Analysis of Amalgamated Graph Transformations

@inproceedings{Born2016AnAF,
title={An Algorithm for the Critical Pair Analysis of Amalgamated Graph Transformations},
author={Kristopher Born and Gabriele Taentzer},
booktitle={ICGT},
year={2016}
}
• Published in ICGT 5 July 2016
• Computer Science
Graph transformation has been shown to be well suited as formal foundation for model transformations. While simple model changes may be specified by simple transformation rules, this is usually not sufficient for more complex changes. In these situations, the concept of amalgamated transformation has been increasingly often used to model for each loops of rule applications which coincide in common core actions. Such a loop can be specified by a kernel rule and a set of extending multi-rules…
3 Citations
Graph Transformation for Software Engineers: With Applications to Model-Based Development and Domain-Specific Language Engineering
• Computer Science
• 2020
This book is the first comprehensive and systematic presentation of graph-based modelling and applications to the practice of software engineering and can be of use in teaching, to present the foundations of software modelling and verification and a reference book for researchers who are active in software modelling.
Multi-granular Conflict and Dependency Analysis in Software Engineering Based on Graph Transformation
• Computer Science
2018 IEEE/ACM 40th International Conference on Software Engineering (ICSE)
• 2018
A novel static CDA technique that is multi-granular in the sense that it can detect all conflicts and dependencies on multiple granularity levels is proposed, which significantly speed up the computation of fine-grained and binary CDA results and complement them with coarse- grained ones, which offer usability benefits for numerous use cases.
Initial Conflicts for Transformation Rules with Nested Application Conditions
• Mathematics
ICGT
• 2020
A sufficient condition is presented illustrating important special cases for rules with ACs, where initial conflicts do not only have initial conflicts being complete in a symbolic way, but also find complete subsets of conflicts in the classical sense.

## References

SHOWING 1-10 OF 20 REFERENCES
Towards Local Confluence Analysis for Amalgamated Graph Transformation
• Computer Science
ICGT
• 2015
Amalgamated graph transformation allows to define schemes of rules coinciding in common core activities and differing over additional parallel independent activities. Consequently, a rule scheme is
Parallel Independence of Amalgamated Graph Transformations Applied to Model Transformation
• Computer Science
Graph Transformations and Model-Driven Engineering
• 2010
An extension of the amalgamation theorem to an arbitrary finite number of synchronous rule applications is proposed and used to show parallel independence of amalgamated graph transformations by analyzing the underlying multi-rules.
Fundamentals of Algebraic Graph Transformation
• Computer Science
Monographs in Theoretical Computer Science. An EATCS Series
• 2006
This is the first textbook treatment of the algebraic approach to graph transformation, based on algebraic structures and category theory. It contains an introduction to classical graphs. Basic and
Formal foundation of consistent EMF model transformations by algebraic graph transformation
• Computer Science
Software & Systems Modeling
• 2011
Containment constraints of EMF model transformations are translated to a special kind of graph transformation rules such that their application leads to consistent transformation results only, and the rich theory of algebraic graph transformation can be applied to these EMf model transformations to show functional behavior and correctness.
Multi-amalgamation of rules with application conditions in $\mathcal{M}$-adhesive categories
• Computer Science
Mathematical Structures in Computer Science
• 2014
The theory of amalgamation for $\mathcal{M}$-adhesive categories, which form a slightly more general framework than (weak) adhesive HLR categories, for a bundle of rules with (nested) application conditions, is presented and the two main results are the Complement Rule Theorem, which shows how to construct a minimal complement rule for each subrule, and the Multi-Amalgamation Theorem.
Analyzing Conflicts and Dependencies of Rule-Based Transformations in Henshin
• Computer Science
FASE
• 2015
The critical pair analysis (CPA) can report all potential conflicts and dependencies of rule applications that may occur during model transformation processes in Henshin, a model transformation environment based on the Eclipse Modeling Framework.
The PROGRES approach: language and environment
• Computer Science
• 1999
The language PROGRES was developed having the following three design goals in mind: Distinguish between data deenition and manipulation activities and use graph schemata to type-check graph transformation rules.
Analysis of Aspect-Oriented Models Using Graph Transformation Systems
• Computer Science
Aspect-Oriented Requirements Engineering
• 2013
In this paper, the complexity of interactions among different aspectualized entities may reduce the benefit of aspect-oriented separation of cross-cutting concerns, so it is desirable to detect inconsistencies as early as possible.
Critical Pairs in Term Graph Rewriting
The present paper introduces critical pairs in term graph rewriting and establishes a Critical Pair Lemma as an analogue to the well-known result in term rewriting, which leads to a decision procedure for confluence in the presence of termination.
On Termination of Graph Rewriting
A necessary and sufficient condition for termination of graph rewriting systems is established, being certain minimal derivations in which each step depends on previous steps, which characterizes termination of arbitrary term rewriting systems under graph rewriting.