arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0912.2160cs.DM
收藏

矩阵图文法:约束的转换

Matrix Graph Grammars: Transformation of Restrictions

Pedro Pablo Perez Velasco

摘要:

在图变换的矩阵方法中,我们用布尔矩阵和向量来表示简单的有向图和规则,而重写仅用布尔运算来表示。在以前的作品中,我们开发的分析技术,使研究的适用性规则序列,它们的独立性,规定的可达性和最小的有向图能够消防序列。在[20]中,图约束和应用条件(所谓的限制)已经被详细研究。在目前的贡献,我们解决的问题,翻译后的条件成先决条件,反之亦然。此外,我们将看到应用条件可以在序列中沿着产生式移动(限制离域)。作为一个实际的理论应用,我们展示了如何应用条件允许我们执行多重有向图重写(而不是简单的有向图重写)使用矩阵图文法

英文摘要:

In the Matrix approach to graph transformation we represent simple digraphs and rules with Boolean matrices and vectors, and the rewriting is expressed using Boolean operations only. In previous works, we developed analysis techniques enabling the study of the applicability of rule sequences, their independence, stated reachability and the minimal digraph able to fire a sequence. In [20], graph constraints and application conditions (so-called restrictions) have been studied in detail. In the present contribution we tackle the problem of translating post-conditions into pre-conditions and vice versa. Moreover, we shall see that application conditions can be moved along productions inside a sequence (restriction delocalization). As a practical-theoretical application we show how application conditions allow us to perform multidigraph rewriting (as opposed to simple digraph rewriting) using Matrix Graph Grammars

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

↑