基于扩展网的规则集表示及终止性分析PetriECARepresentationand.PDFVIP

第34 卷第3 期 通 信 学 报 Vol.34 No. 3 2013 年3 月 Journa l on Communications March 2013 doi:10.3969/j .issn.1000-436x.2013.03.020 基于扩展Petri 网的ECA 规则集表示及终止性分析 张立臣，王小明，窦文阳 （陕西师范大学 计算机科学学院，陕西 西安 7 10062 ） 摘 要：为了提高ECA 规则集可终止性分析的准确性，建立了一种可描述ECA 规则集的扩展Petri 网(EPN, ex- tended Petri net)模型，在此基础上研究并提出了一种ECA 规则集终止性判定算法。该算法充分利用EPN 所包含 ECA 规则特性的丰富信息，综合分析了ECA 规则特性对规则集可终止性的影响。理论分析和实验结果表明，所 提出的算法具有更高的准确性和更低的时间复杂度。 关键词：ECA 规则；Petri 网；终止性分析；EPN ；模型表示 中图分类号：TP311 文献标识码：B 文章编号：1000-436X (20 13)03-0157-08 Representation and termination analysis for ECA rules based on extended Petri net ZHAN G Li-chen, WANG Xiao-ming, DOU Wen-yang (Schoo l o f Computer Sc ience, Shaanxi N orma l University, X i’an 7 10062, China) Abstract: In order to improve th e accuracy of the termin ation an lys is on ECA ru les, a novel representation model (EPN, extended Petri net) of ECA rules was built. Based on the EPN, an effectiv e termination decision algorithm was discussed and prop osed . By using p lenty of information ab out th e ru le characteristics in EPN, th e proposed termin ation algorithm could comprehensiv ely an alyze the influence on the termination analysis. The theoretical an alys is and exp erim ental r e- sults show that the prop osed algorithm h as higher accuracy and low er time comp lexity. Key words: ECA ru le; Petri net; termination analysis; extended Petri n et; model representation 等，导致 ECA