Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming

Author:

Weidmann Nils,Anjorin Anthony

Abstract

AbstractIn the field of Model-Driven Engineering, Triple Graph Grammars (TGGs) play an important role as a rule-based means of implementing consistency management. From a declarative specification of a consistency relation, several operations including forward and backward transformations, (concurrent) synchronisation, and consistency checks can be automatically derived. For TGGs to be applicable in realistic application scenarios, expressiveness in terms of supported language features is very important. A TGG tool is schema compliant if it can take domain constraints, such as multiplicity constraints in a meta-model, into account when performing consistency management tasks. To guarantee schema compliance, most TGG tools allow application conditions to be attached as necessary to relevant rules. This strategy is problematic for at least two reasons: First, ensuring compliance to a sufficiently expressive schema for all previously mentioned derived operations is still an open challenge; to the best of our knowledge, all existing TGG tools only support a very restricted subset of application conditions. Second, it is conceptually demanding for the user to indirectly specify domain constraints as application conditions, especially because this has to be completely revisited every time the TGG or domain constraint is changed. While domain constraints can in theory be automatically transformed to obtain the required set of application conditions, this has only been successfully transferred to TGGs for a very limited subset of domain constraints. To address these limitations, this paper proposes a search-based strategy for achieving schema compliance. We show that all correctness and completeness properties, previously proven in a setting without domain constraints, still hold when schema compliance is to be additionally guaranteed. An implementation and experimental evaluation are provided to support our claim of practical applicability.

Funder

Ministeriums für Wirtschaft, Innovation, Digitalisierung und Energie des Landes Nordrhein-Westfalen

Publisher

Association for Computing Machinery (ACM)

Subject

Theoretical Computer Science,Software

Reference44 articles.

1. Anjorin A, Schürr A, Taentzer G (2012a) Construction of integrity preserving triple graph grammars. In: Ehrig H, Engels G, Kreowski H-J, Rozenberg G (eds) ICGT 2012. Springer, Berlin.

2. Anjorin A, Varró G, Schürr A (2012b) Complex attribute manipulation in tggs with constraint-based programming techniques. Electron Commun Eur Assoc Softw Sci Technol 49

3. Anjorin A, Saller K, Lochau M, Schürr A (2014) Modularizing triple graph grammars using rule refinement. In: Gnesi S, Rensink A (eds) FASE 2014. Springer, Berlin.

4. Anjorin A, Leblebici E, Schürr A (2015) 20 years of triple graph grammars: a roadmap for future research. ECEASST, 73:1–20.

5. Anjorin A, Yigitbas E, Leblebici E, Schürr A, Lauder M, Witte M (2018) Description languages for consistency management scenarios based on examples from the industry automation domain. Art Sci Eng Program 2(3):7.

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3