Initial Conflicts and Dependencies: Critical Pairs Revisited

Lambers, Leen; Born, Kristopher; Orejas, Fernando; Strüber, Daniel; Taentzer, Gabriele

doi:10.1007/978-3-319-75396-6_6

Cited by 13 publications

(77 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It ensures that checking each critical pair (or each initial conflict) for strict confluence guarantees local confluence for the entire transformation system [9,8]. It was already shown that conflicts are reflected by extension [13], i.e. when the extension of a transformation pair is in conflict, the original transformation pair is in conflict as well.…”

Section: Conflict Essence and Extensionmentioning

confidence: 99%

“…The extension of a transformation into a larger context underlies the concept of completeness of critical pairs and initial conflicts: any pair of conflicting transformations is the extension of a critical pair [9,8] and of an initial conflict [13]. It ensures that checking each critical pair (or each initial conflict) for strict confluence guarantees local confluence for the entire transformation system [9,8].…”

Section: Conflict Essence and Extensionmentioning

confidence: 99%

“…is a [8] has unique [14] uniquely determines [14] represented by unique [14] is a [14] is a [13] represented by unique [13] has unique (Def. 21) contained in (Theorem 32) uniquely determines (Theorem 34)…”

Section: Introductionmentioning

confidence: 99%

“…They were proven complete (for the categories of graphs and typed graphs [14]), in the sense that every critical pair is the embedding of some essential critical pair into a larger context. More recently, initial conflicts were also proposed and proven to be a complete subset of critical pairs (in any adhesive category [13]), and were proven to exist for the categories of graphs and typed graphs. Relations between initial conflicts and conflict reasons were not reported, to the best of our knowledge.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

On the Essence and Initiality of Conflicts

Azzi

Corradini

Ribeiro

2018

Graph Transformation

View full text Add to dashboard Cite

Understanding conflicts between transformations and rules is an important topic in algebraic graph transformation. A conflict occurs when two transformations are not parallel independent, that is, when after applying one of them the other can no longer occur. We contribute to this research thread by proposing a new characterization of the root causes of conflicts, called "conflict essences". By exploiting a recently proposed characterization of parallel independence we easily show that the conflict essence of two transformations is empty i↵ they are parallel independent. Furthermore we show that conflict essences are smaller than the "conflict reasons" previously proposed, and that they uniquely determine the so-called "initial conflicts". All results hold in categories of Set-valued functors, which include the categories of graphs and typed graphs, and several of them hold in the more general adhesive categories.

show abstract

Section: Conflict Essence and Extensionmentioning

confidence: 99%

Section: Conflict Essence and Extensionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

On the Essence and Initiality of Conflicts

Azzi

Corradini

Ribeiro

2018

Graph Transformation

View full text Add to dashboard Cite

show abstract

“…• CDA: Conflict and Dependency Analyses include static analysis techniques (at rule-level rather than involving state graphs and transitions) to determine the possibility of conflicts or dependencies between rules. Critical pair analysis has its origins in term rewriting and has been generalised to term graph rewriting in [52,54] and typed attributed graph transformations in [31,40,41]. Dependency analysis is an analogous technique applied to consecutive rather than branching transformations.…”

Section: Techniquesmentioning

confidence: 99%

Analysis of Graph Transformation Systems: Native vs Translation-based Techniques

Heckel¹,

Lambers²,

Saadat³

2019

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

The paper summarises the contributions in a session at GCM 2019 presenting and discussing the use of native and translation-based solutions to common analysis problems for Graph Transformation Systems (GTSs). In addition to a comparison of native and translation-based techniques in this area, we explore design choices for the latter, s.a. choice of logic and encoding method, which have a considerable impact on the overall quality and complexity of the analysis. We substantiate our arguments by citing literature on application of theorem provers, model checkers, and SAT/SMT solver in GTSs, and conclude with a general discussion from a software engineering perspective, including comments from the workshop participants, and recommendations on how to investigate important design choices in the future.

show abstract