基于矩阵运算的图转换检测算法

　　本文基于图是一种可以把复杂的问题直观地表示出来的自然的方式，已应用于计算机科学的几乎所有方面，从而图转换系统(GTS)得到了广泛的用，但是在图转换系统中不同的规则复合会产生冲突，想通过计算机系统自动判断不同规则能否复合，减少规则复合人工干涉这一目的，采用了矩阵运算的方法，并且定义冲突矩阵，关联矩阵以及规则链等概念，将各个规则看作各个规则的节点，这样就形成一个有向的规则链。记作pi→pi+1→…→pj，计算各个规则链长度的方法，得到了个规则节点到其他节点的长度，通过寻找复合规则之间长度为l的规则链是否存在，从而检测出这一系列规则有无冲突。

　　Abstract:

　　The paper is based on the mothed which a complex problem can be expressed directly in the natural way by the graph， it has been used in almost all aspects of computer science.The graph transformation system (GTS) has been widely used， but different rules in the graph transformation system may conflict. Whether it determine the different rules have conflict by automatic computer system， it reduce the human intervention between the compound of different rules. It use the matrix operations and define the notions of conflict matrix， correlation matrix， the chains of rules, which think the rule as a node. There is a direction rules chains pi→pi+1→…→pj the length of the chains can be calculated. It can determine whether the different rules have conflict by looking for the existence of chain which the length is l. According to the relations between the compound of rules and matrix operations， a automatic graph transformation systems detecting algorithm is put forward.