Research output: Chapter in Book/Report/Conference proceeding › Conference paper

**Graph Consistency as a Graduated Property : Consistency-Sustaining and -Improving Graph Transformations.** / Kosiol, Jens; Strüber, Daniel; Taentzer, Gabriele; Zschaler, Steffen.

Research output: Chapter in Book/Report/Conference proceeding › Conference paper

Kosiol, J, Strüber, D, Taentzer, G & Zschaler, S 2020, Graph Consistency as a Graduated Property: Consistency-Sustaining and -Improving Graph Transformations. in *International Conference on Graph Transformations (ICGT'20).*

Kosiol, J., Strüber, D., Taentzer, G., & Zschaler, S. (Accepted/In press). Graph Consistency as a Graduated Property: Consistency-Sustaining and -Improving Graph Transformations. In *International Conference on Graph Transformations (ICGT'20) *

Kosiol J, Strüber D, Taentzer G, Zschaler S. Graph Consistency as a Graduated Property: Consistency-Sustaining and -Improving Graph Transformations. In International Conference on Graph Transformations (ICGT'20). 2020

@inbook{f0abdcb386e04e73b2c00ac644a4e385,

title = "Graph Consistency as a Graduated Property: Consistency-Sustaining and -Improving Graph Transformations",

abstract = "Where graphs are used for modelling and specifying systems, consistency is an important concern. To be a valid model of a system, the graph structure must satisfy a number of constraints. To date, consistency has primarily been viewed as a binary property: a graph either is or is not consistent with respect to a set of graph constraints. This has enabled the definition of notions such as constraint-preserving and constraint-guaranteeing graph transformations. Many practical applications—for example model repair or evolutionary search—implicitly assume a more graduated notion of consistency, but without an explicit formalisation only limited analysis of these applications is possible. In this paper, we introduce an explicit notion of consistency as a graduated property, depending on the number of constraint violations in a graph. We present two new characterisations of transformations (and transformation rules) enabling reasoning about the gradual introduction of consistency: while consistency-sustaining transformations do not decrease the consistency level, consistency-improving transformations strictly reduce the number of constraint violations. We show how these new definitions refine the existing concepts of constraint-preserving and constraint-guaranteeing transformations. To support a static analysis based on our characterisations, we present criteria for deciding which form of consistency ensuring transformations is induced by the application of a transformation rule. We illustrate our contributions in the context of an example from search-based model engineering.",

author = "Jens Kosiol and Daniel Str{\"u}ber and Gabriele Taentzer and Steffen Zschaler",

year = "2020",

month = "4",

day = "21",

language = "English",

booktitle = "International Conference on Graph Transformations (ICGT'20)",

}

TY - CHAP

T1 - Graph Consistency as a Graduated Property

T2 - Consistency-Sustaining and -Improving Graph Transformations

AU - Kosiol, Jens

AU - Strüber, Daniel

AU - Taentzer, Gabriele

AU - Zschaler, Steffen

PY - 2020/4/21

Y1 - 2020/4/21

N2 - Where graphs are used for modelling and specifying systems, consistency is an important concern. To be a valid model of a system, the graph structure must satisfy a number of constraints. To date, consistency has primarily been viewed as a binary property: a graph either is or is not consistent with respect to a set of graph constraints. This has enabled the definition of notions such as constraint-preserving and constraint-guaranteeing graph transformations. Many practical applications—for example model repair or evolutionary search—implicitly assume a more graduated notion of consistency, but without an explicit formalisation only limited analysis of these applications is possible. In this paper, we introduce an explicit notion of consistency as a graduated property, depending on the number of constraint violations in a graph. We present two new characterisations of transformations (and transformation rules) enabling reasoning about the gradual introduction of consistency: while consistency-sustaining transformations do not decrease the consistency level, consistency-improving transformations strictly reduce the number of constraint violations. We show how these new definitions refine the existing concepts of constraint-preserving and constraint-guaranteeing transformations. To support a static analysis based on our characterisations, we present criteria for deciding which form of consistency ensuring transformations is induced by the application of a transformation rule. We illustrate our contributions in the context of an example from search-based model engineering.

AB - Where graphs are used for modelling and specifying systems, consistency is an important concern. To be a valid model of a system, the graph structure must satisfy a number of constraints. To date, consistency has primarily been viewed as a binary property: a graph either is or is not consistent with respect to a set of graph constraints. This has enabled the definition of notions such as constraint-preserving and constraint-guaranteeing graph transformations. Many practical applications—for example model repair or evolutionary search—implicitly assume a more graduated notion of consistency, but without an explicit formalisation only limited analysis of these applications is possible. In this paper, we introduce an explicit notion of consistency as a graduated property, depending on the number of constraint violations in a graph. We present two new characterisations of transformations (and transformation rules) enabling reasoning about the gradual introduction of consistency: while consistency-sustaining transformations do not decrease the consistency level, consistency-improving transformations strictly reduce the number of constraint violations. We show how these new definitions refine the existing concepts of constraint-preserving and constraint-guaranteeing transformations. To support a static analysis based on our characterisations, we present criteria for deciding which form of consistency ensuring transformations is induced by the application of a transformation rule. We illustrate our contributions in the context of an example from search-based model engineering.

M3 - Conference paper

BT - International Conference on Graph Transformations (ICGT'20)

ER -

King's College London - Homepage

© 2018 King's College London | Strand | London WC2R 2LS | England | United Kingdom | Tel +44 (0)20 7836 5454