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

矩阵图文法及其应用条件

Matrix Graph Grammars with Application Conditions

Pedro Pablo Perez Velasco, Juan de Lara Jaramillo

摘要:

在图变换的矩阵方法中,我们用布尔矩阵和向量来表示简单的有向图和规则,而重写只使用布尔运算符来表示。在以前的作品中,我们开发的分析技术,使研究的适用性规则序列,它们的独立性,状态可达性和最小的图形能够激发一个序列。在本文中,我们从两个方面改进我们的框架。首先,我们明确(在布尔矩阵的形式)规则中的一些负隐式信息。这个矩阵(称为零化矩阵)包含禁止应用规则的元素(即潜在的悬挂边,或新添加的边,它们不可能已经存在于简单有向图中)。其次,我们引入了一个新的应用条件的概念,它结合了图图与一元二阶逻辑。这允许比以前的方法更大的灵活性和表现力,以及在某些情况下更简洁的条件。我们证明,这些应用条件可以嵌入到规则(即在左手边和虚无矩阵),并表明,具有任意应用条件的规则的适用性是等同于没有应用条件的普通规则序列的适用性。因此,对前者的分析相当于对后者的分析,表明在我们的框架中,不需要额外的结果来研究应用条件。此外,[21,22]中用于序列研究的所有分析技术都可以应用于应用条件。

英文摘要:

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 operators only. In previous works, we developed analysis techniques enabling the study of the applicability of rule sequences, their independence, state reachability and the minimal graph able to fire a sequence. In the present paper we improve our framework in two ways. First, we make explicit (in the form of a Boolean matrix) some negative implicit information in rules. This matrix (called nihilation matrix) contains the elements that, if present, forbid the application of the rule (i.e. potential dangling edges, or newly added edges, which cannot be already present in the simple digraph). Second, we introduce a novel notion of application condition, which combines graph diagrams together with monadic second order logic. This allows for more flexibility and expressivity than previous approaches, as well as more concise conditions in certain cases. We demonstrate that these application conditions can be embedded into rules (i.e. in the left hand side and the nihilation matrix), and show that the applicability of a rule with arbitrary application conditions is equivalent to the applicability of a sequence of plain rules without application conditions. Therefore, the analysis of the former is equivalent to the analysis of the latter, showing that in our framework no additional results are needed for the study of application conditions. Moreover, all analysis techniques of [21, 22] for the study of sequences can be applied to application conditions.

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

↑