基于扩展Petri网的ECA规则集表示及终止性分析

Representation and termination analysis for ECA rules based on extended Petri net

为了提高ECA规则集可终止性分析的准确性,建立了一种可描述ECA规则集的扩展Petri网(EPN,extended Petri net)模型,在此基础上研究并提出了一种ECA规则集终止性判定算法。该算法充分利用EPN所包含ECA规则特性的丰富信息,综合分析了ECA规则特性对规则集可终止性的影响。理论分析和实验结果表明,所提出的算法具有更高的准确性和更低的时间复杂度。

In order to improve the accuracy of the termination analysis on ECA rules, a novel representation model （EPN, extended Petri net） of ECA rules was built. Based on the EPN, an effective termination decision algorithm was discussed and proposed. By using plenty of information about the rule characteristics in EPN, the proposed termination algorithm could comprehensively analyze the influence on the termination analysis. The theoretical analysis and experimental resuits show that the proposed algorithm has higher accuracy and lower time complexity.