---
_id: '23525'
abstract:
- lang: eng
  text: "<jats:title>Abstract</jats:title><jats:p>In the field of Model-Driven Engineering,
    Triple Graph Grammars\r\n(TGGs) play an important role as a rule-based means of
    implementing\r\nconsistency management. From a declarative specification of a\r\nconsistency
    relation, several operations including forward and\r\nbackward transformations,
    (concurrent) synchronisation, and\r\nconsistency checks can be automatically derived.
    For TGGs to be\r\napplicable in realistic application scenarios, expressiveness
    in\r\nterms of supported language features is very important. A TGG tool\r\nis
    schema compliant if it can take domain constraints, such as\r\nmultiplicity constraints
    in a meta-model, into account when\r\nperforming consistency management tasks.
    To guarantee schema\r\ncompliance, most TGG tools allow application conditions
    to be\r\nattached as necessary to relevant rules. This strategy is\r\nproblematic
    for at least two reasons: First, ensuring compliance to\r\na sufficiently expressive
    schema for all previously mentioned\r\nderived operations is still an open challenge;
    to the best of our\r\nknowledge, all existing TGG tools only support a very restricted\r\nsubset
    of application conditions. Second, it is conceptually\r\ndemanding for the user
    to indirectly specify domain constraints as\r\napplication conditions, especially
    because this has to be completely\r\nrevisited every time the TGG or domain constraint
    is changed. While\r\ndomain constraints can in theory be automatically transformed
    to\r\nobtain the required set of application conditions, this has only\r\nbeen
    successfully transferred to TGGs for a very limited subset of\r\ndomain constraints.
    To address these limitations, this paper\r\nproposes a search-based strategy for
    achieving schema compliance. We\r\nshow that all correctness and completeness
    properties, previously\r\nproven in a setting without domain constraints, still
    hold when\r\nschema compliance is to be additionally guaranteed. An\r\nimplementation
    and experimental evaluation are provided to support\r\nour claim of practical
    applicability.</jats:p>"
author:
- first_name: Nils
  full_name: Weidmann, Nils
  id: '53103'
  last_name: Weidmann
- first_name: Anthony
  full_name: Anjorin, Anthony
  last_name: Anjorin
citation:
  ama: Weidmann N, Anjorin A. Schema Compliant Consistency Management via Triple Graph
    Grammars and Integer Linear Programming. <i>Formal Aspects of Computing</i>. 2021.
    doi:<a href="https://doi.org/10.1007/s00165-021-00557-0">10.1007/s00165-021-00557-0</a>
  apa: Weidmann, N., &#38; Anjorin, A. (2021). Schema Compliant Consistency Management
    via Triple Graph Grammars and Integer Linear Programming. <i>Formal Aspects of
    Computing</i>. <a href="https://doi.org/10.1007/s00165-021-00557-0">https://doi.org/10.1007/s00165-021-00557-0</a>
  bibtex: '@article{Weidmann_Anjorin_2021, title={Schema Compliant Consistency Management
    via Triple Graph Grammars and Integer Linear Programming}, DOI={<a href="https://doi.org/10.1007/s00165-021-00557-0">10.1007/s00165-021-00557-0</a>},
    journal={Formal Aspects of Computing}, publisher={Springer}, author={Weidmann,
    Nils and Anjorin, Anthony}, year={2021} }'
  chicago: Weidmann, Nils, and Anthony Anjorin. “Schema Compliant Consistency Management
    via Triple Graph Grammars and Integer Linear Programming.” <i>Formal Aspects of
    Computing</i>, 2021. <a href="https://doi.org/10.1007/s00165-021-00557-0">https://doi.org/10.1007/s00165-021-00557-0</a>.
  ieee: N. Weidmann and A. Anjorin, “Schema Compliant Consistency Management via Triple
    Graph Grammars and Integer Linear Programming,” <i>Formal Aspects of Computing</i>,
    2021.
  mla: Weidmann, Nils, and Anthony Anjorin. “Schema Compliant Consistency Management
    via Triple Graph Grammars and Integer Linear Programming.” <i>Formal Aspects of
    Computing</i>, Springer, 2021, doi:<a href="https://doi.org/10.1007/s00165-021-00557-0">10.1007/s00165-021-00557-0</a>.
  short: N. Weidmann, A. Anjorin, Formal Aspects of Computing (2021).
date_created: 2021-08-25T18:07:25Z
date_updated: 2022-01-06T06:55:56Z
department:
- _id: '28'
- _id: '66'
doi: 10.1007/s00165-021-00557-0
language:
- iso: eng
publication: Formal Aspects of Computing
publication_identifier:
  issn:
  - 0934-5043
  - 1433-299X
publication_status: published
publisher: Springer
status: public
title: Schema Compliant Consistency Management via Triple Graph Grammars and Integer
  Linear Programming
type: journal_article
user_id: '53103'
year: '2021'
...