|Re: [henshin-user] CDA vs CPA|
we have documentation at https://github.com/dstrueber/multicda
Note that the old CPA stuff is still around, but has been renamed to org.eclipse.emf.henshin.multicda.cpa.*
Generally, the new CDA (multi-CDA) now has three levels of granularity (binary / coarse / fine), where the "fine" level is almost the same as essential critical pairs.
I say "almost":
First, the "fine" granularity level is based on an improvement to ess. CPs, called "initial conflicts", that avoids some weird edges of ess. CPs which one would not actually consider essential (see ). Occasionally, there will be fewer fine conflicts than ess. CPs.
Second, the point of using the abbreviation "CDA" (conflict and dependency analysis) is that we don't report critical pairs anymore, but conflict reasons. Critical pairs are the "lower" span in the pullback, or, in other words, the graph arising from overlapping the left-hand sides. Conflict reasons are the "upper" span in the pullback, or, in other words, the intersection of both graphs. More rationale for this is found in the running example section in .
For the interpretation of the results, this means that the mappings go from the graph into the rules' left hand-sides, and not the other way around.
 Initial Conflicts and Dependencies: Critical Pairs Revisited Leen Lambers, Kristopher Born, Fernando Orejas, Daniel Strüber and Gabriele Taentzer. In: Graph Transformation, Specifications, and Nets. In Memory of Hartmut Ehrig. Springer. pp. 105-123. http://danielstrueber.de/publications/LBOST17.pdf
 Multi-Granular Conflict and Dependency Analysis in Software Engineering based on Graph Transformation
Leen Lambers, Daniel Strüber, Gabriele Taentzer, Kristopher Born, Jevgenij Hübert. In: ICSE 2018: International Conference on Software Engineering. IEEE/ACM. pp. 716-727. https://www.uni-marburg.de/fb12/arbeitsgruppen/swt/forschung/publikationen/2018/LSTBH18.pdf
On 08.04.2019 15:09, Zschaler, Steffen wrote: