There is an increasing need for model transformations ensuring valid result models w.r.t. a given constraint. In model refactoring, for example, each performed refactoring should yield a valid model again. Given a constraint, if a model transformation rule always produces valid output, it is called constraint-guaranteeing; if only when applied to an already valid model, it is called constraint-preserving. In the literature, there is a formal construction for model transformation systems making them constraint-guaranteeing. This is ensured by adding application conditions to their transformation rules. These conditions can become quite large, though. As there are interesting application cases where transformations just need to be constraint-preserving (such as model refactoring), the construction of application conditions was also adapted to this case. Although logically weaker, the straightforward construction can lead to even larger application conditions. In this work, we develop simplifications of constraint-guaranteeing conditions by omitting certain parts of these conditions, namely of parts that check for antecedent validity. We prove that the resulting application conditions are constraint-preserving and characterize their logical strength. Our theory is developed for $\mathcal{M}$-adhesive categories which encompass various graph-like model structures. In addition, the computation of constraint-guaranteeing application conditions and their simplifications was implemented in the Eclipse plug-in OCL2AC. Evaluations show that the complexity of the constructed simplified conditions is reduced by factor 7 on average. Moreover, this optimization yields a speedup of rule application by approximately 2.5 times.

对模型转换的需求不断增加，以确保有效的结果模型具有给定的约束。例如，在模型重构中，每次执行的重构都应再次产生有效的模型。给定一个约束，如果模型转换规则始终产生有效的输出，则称为约束保证；如果仅将其应用于已经有效的模型，则称为约束保留。在文献中，对模型转换系统进行了形式化的构造，使其成为约束保证。通过将应用程序条件添加到其转换规则中可以确保这一点。但是，这些条件可能会变得很大。由于有一些有趣的应用案例，其中的转换只需要保留约束即可（例如模型重构），因此应用条件的构建也适用于这种情况。尽管逻辑上较弱，但直接的构造可能会导致更大的应用条件。在这项工作中，我们通过省略这些条件的某些部分（即检查先验有效性的部分）来简化约束保证条件。我们证明了所得的应用条件是约束保留的，并表征了它们的逻辑强度。$\mathcal{中号}$-包含各种图样模型结构的胶粘剂类别。另外，在Eclipse插件OCL2AC中实现了约束保证应用程序条件的计算及其简化。评估表明，所构造的简化条件的复杂度平均降低了7倍。此外，此优化可将规则应用速度提高约2.5倍。