论文标题
补丁图重写（扩展版本）
Patch Graph Rewriting (Extended Version)
论文作者
论文摘要
图形重写的基本原理是主机图内的子图的逐步替换。此类替代步骤中的一个挑战是贴片图的处理，由接触子图的主机图的那些边缘组成，但不是其中的一部分。 我们介绍了补丁图重写框架，这是一种具有精确正式语义的视觉图形翻新语言。该语言通过两种方式具有丰富的表达能力。首先，规则可以灵活地约束触摸匹配子图的补丁的允许形状。其次，规则可以自由地改变补丁。尽管该框架设计为易于理解，但它涵盖了许多图形重写的方法。
The basic principle of graph rewriting is the stepwise replacement of subgraphs inside a host graph. A challenge in such replacement steps is the treatment of the patch graph, consisting of those edges of the host graph that touch the subgraph, but are not part of it. We introduce the patch graph rewriting framework, a visual graph rewriting language with precise formal semantics. The language has rich expressive power in two ways. Firstly, rules can flexibly constrain the permitted shapes of patches touching matching subgraphs. Secondly, rules can freely transform patches. While the framework is designed to be easy to understand, it subsumes many approaches to graph rewriting.
