论文标题
层次结构中重写的可逆性和组成
Reversibility and Composition of Rewriting in Hierarchies
论文作者
论文摘要
在本文中，我们研究了如何逆转基于sesqui-pushout重写的图形转换以及如何构建重写的组成。我们说明了如何使用这种可逆性和组成来设计用于单个图形和图形层次结构的审计跟踪系统。这为我们提供了一种紧凑的方法，可以维护对象的更新历史记录，包括其多个版本。设计框架的主要应用是图形层次结构表示的知识的更新审计跟踪。因此，我们介绍了代表整个层次结构转换的规则层次结构的概念，研究如何将规则层次结构应用于层次结构并分析该应用程序可逆的条件。然后，我们提出了一种构建连续层次结构重写组成的理论。针对具有属性的简单图形层次结构转换的原型审核跟踪系统将作为Regraph Python库的一部分实现。
In this paper, we study how graph transformations based on sesqui-pushout rewriting can be reversed and how the composition of rewrites can be constructed. We illustrate how such reversibility and composition can be used to design an audit trail system for individual graphs and graph hierarchies. This provides us with a compact way to maintain the history of updates of an object, including its multiple versions. The main application of the designed framework is an audit trail of updates to knowledge represented by hierarchies of graphs. Therefore, we introduce the notion of rule hierarchy that represents a transformation of the entire hierarchy, study how rule hierarchies can be applied to hierarchies and analyse the conditions under which this application is reversible. We then present a theory for constructing the composition of consecutive hierarchy rewrites. The prototype audit trail system for transformations in hierarchies of simple graphs with attributes is implemented as part of the ReGraph Python library.
