Graph transformation detecting algorithm based on matrix operations

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.