arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2307.09150cs.SE
收藏

使用最小受限一致性改进变换的基于规则的图修复

Rule-based Graph Repair using Minimally Restricted Consistency-Improving Transformations

Alexander Lauer

AI总结:

本文针对基于规则的图修复,提出按嵌套层级衡量一致性的新变换与规则概念,并构造相应应用条件,实现对循环无冲突约束及约束集合的修复。

摘要:

模型驱动软件工程是应对软件开发过程日益增长复杂性的合适方法。图和图变换已被证明可用于表示此类模型及其变更。这些模型必须满足特定的约束集合,例如类结构的多重性。在开发过程中,对模型的变更可能导致模型不一致,并且必须在某个时刻进行修复。该问题称为模型修复。具体而言,我们将考虑基于规则的图修复,其定义如下:给定图 G、G 不满足的约束 c 以及规则集合 R,使用 R 中的规则将 G 变换为满足 c 的图。已知的一致性概念要么将一致性视为二元属性,即图相对于约束 c 要么一致、要么不一致,要么只考虑约束首个图的违例数量。在本文中,我们引入新的一致性概念,分别称为一致性保持和一致性提升的变换与规则。这基于约束可以在某个嵌套层级内得到满足的可能性。我们分别给出了直接一致性保持或直接一致性提升应用条件的构造。最后,我们提出一种基于规则的图修复方法,该方法能够修复所谓的循环无冲突约束,以及所谓的循环无冲突约束集合。直观上,约束集合 C 是循环无冲突的,如果存在 C 中所有约束的一个排序 c_1, …, c_n,使得不存在 j < i 会让在所有满足 c_j 的图上对 c_i 的修复产生不满足 c_j 的图。

英文摘要:

Model-driven software engineering is a suitable method for dealing with the ever-increasing complexity of software development processes. Graphs and graph transformations have proven useful for representing such models and changes to them. These models must satisfy certain sets of constraints. An example are the multiplicities of a class structure. During the development process, a change to a model may result in an inconsistent model that must at some point be repaired. This problem is called model repair. In particular, we will consider rule-based graph repair which is defined as follows: Given a graph $G$, a constraint $c$ such that $G$ does not satisfy $c$, and a set of rules $R$, use the rules of $\mathcal{R}$ to transform $G$ into a graph that satisfies $c$. Known notions of consistency have either viewed consistency as a binary property, either a graph is consistent w.r.t. a constraint $c$ or not, or only viewed the number of violations of the first graph of a constraint. In this thesis, we introduce new notions of consistency, which we call consistency-maintaining and consistency-increasing transformations and rules, respectively. This is based on the possibility that a constraint can be satisfied up to a certain nesting level. We present constructions for direct consistency-maintaining or direct consistency-increasing application conditions, respectively. Finally, we present an rule-based graph repair approach that is able to repair so-called \emph{circular conflict-free constraints}, and so-called circular conflict-free sets of constraints. Intuitively, a set of constraint $C$ is circular conflict free, if there is an ordering $c_1, \ldots, c_n$ of all constraints of $C$ such that there is no $j <i$ such that a repair of $c_i$ at all graphs satisfying $c_j$ leads to a graph not satisfying $c_j$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑