Initial Conflicts and Dependencies: Critical Pairs Revisited (bibtex)

by Lambers, Leen, Born, Kristopher, Orejas, Fernando, StrĂ¼ber, Daniel and Taentzer, Gabriele

Abstract:

Considering a graph transformation system, a critical pair represents a pair of conflicting transformations in a minimal context. A conflict between two direct transformations of the same structure occurs if one of the transformations cannot be performed in the same way after the other one has taken place. Critical pairs allow for static conflict and dependency detection since there exists a critical pair for each conflict representing this conflict in a minimal context. Moreover it is sufficient to check each critical pair for strict confluence to conclude that the whole transformation system is locally confluent. Since these results were shown in the general categorical framework of M-adhesive systems, they can be instantiated for a variety of systems transforming e.g. (typed attributed) graphs, hypergraphs, and Petri nets.

Reference:

Initial Conflicts and Dependencies: Critical Pairs Revisited (Lambers, Leen, Born, Kristopher, Orejas, Fernando, StrĂ¼ber, Daniel and Taentzer, Gabriele), Chapter in (Heckel, Reiko, Taentzer, Gabriele, eds.), Springer International Publishing, 2018.

Bibtex Entry:

@InBook{Lambers2018, pages = {105--123}, title = {{Initial Conflicts and Dependencies: Critical Pairs Revisited}}, publisher = {Springer International Publishing}, year = {2018}, author = {Lambers, Leen and Born, Kristopher and Orejas, Fernando and Str{\"u}ber, Daniel and Taentzer, Gabriele}, editor = {Heckel, Reiko and Taentzer, Gabriele}, address = {Cham}, isbn = {978-3-319-75396-6}, __markedentry = {[piets:1]}, abstract = {Considering a graph transformation system, a critical pair represents a pair of conflicting transformations in a minimal context. A conflict between two direct transformations of the same structure occurs if one of the transformations cannot be performed in the same way after the other one has taken place. Critical pairs allow for static conflict and dependency detection since there exists a critical pair for each conflict representing this conflict in a minimal context. Moreover it is sufficient to check each critical pair for strict confluence to conclude that the whole transformation system is locally confluent. Since these results were shown in the general categorical framework of M-adhesive systems, they can be instantiated for a variety of systems transforming e.g. (typed attributed) graphs, hypergraphs, and Petri nets.}, booktitle = {Graph Transformation, Specifications, and Nets: In Memory of Hartmut Ehrig}, doi = {10.1007/978-3-319-75396-6_6}, url = {https://doi.org/10.1007/978-3-319-75396-6_6}, }

Powered by bibtexbrowser