本文基于圖是一種可以把復(fù)雜的問題直觀地表示出來的自然的方式，已應(yīng)用于計算機科學(xué)的幾乎所有方面，從而圖轉(zhuǎn)換系統(tǒng)(GTS)得到了廣泛的用，但是在圖轉(zhuǎn)換系統(tǒng)中不同的規(guī)則復(fù)合會產(chǎn)生沖突，想通過計算機系統(tǒng)自動判斷不同規(guī)則能否復(fù)合，減少規(guī)則復(fù)合人工干涉這一目的，采用了矩陣運算的方法，并且定義沖突矩陣，關(guān)聯(lián)矩陣以及規(guī)則鏈等概念，將各個規(guī)則看作各個規(guī)則的節(jié)點，這樣就形成一個有向的規(guī)則鏈。記作pi→pi+1→…→pj，計算各個規(guī)則鏈長度的方法，得到了個規(guī)則節(jié)點到其他節(jié)點的長度，通過尋找復(fù)合規(guī)則之間長度為l的規(guī)則鏈是否存在，從而檢測出這一系列規(guī)則有無沖突。

　　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.