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

  • 3
  • 0
  • 约5万字
  • 约 8页
  • 2015-08-21 发布于安徽
  • 举报

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

基于扩展Petri 网的ECA 规则集表示及终止性分析 张立臣, 王小明, 窦文阳 ( 陕西师范大学 计算机科学学院, 西安 710062) 摘 要: ECA 规则可以有效地表示主动性知识,是知识表示与推理领域的研究热点之一.复合事件、复合条件和事件消耗模式是ECA 规则的重要结构特性,对ECA规则的结构和行为特性具有重要影响.现有ECA规则的表示模型只是部分包含上述结构特性.为了综合分 析这些结构特性对 ECA 规则集的表示和可终止性的影响,扩展传统有色 Petri 网,提出了一种可描述 ECA 规则的扩展 Petri 网模型 (Extended Petri Net, EPN),设计了ECA 规则集的EPN 网转化算法,并基于所提出的EPN 网模型,提出了一种有效的ECA 规则集静态 终止性判定算法,能够综合分析复合事件、复合条件对ECA 规则集的可终止性判定的影响.与现有 ECA 规则集终止性判定算法相比, 所提出的算法具有更好的准确性和实用性. 关键词: ECA 规则;Petri 网;抑制弧;检测弧;终止性分析 中图法分类号: TP311 文献标识码: A Representation and Termination Analysis for ECA Rules Based on Extended Petri Net ZHANG Li-chen, WANG Xiao-ming, DOU Wen-yang (School of Computer Science, Shaanxi Normal University, Xi’an 710062, China) Abstract : ECA(Event-Condition-Action) rules, being used in expressing active knowledge, is one of hot research topics in knowledge representation and inference research area. Composite events, composite conditions and event consumption modes are important components related to ECA rules, which have important influence on ECA rules’ structure and behavior. Current representation models just partly include these components. In order to analyze the influence on ECA rules’ termination under these components, a n ew ECA rules representation model(Extended Petri Net, EPN) is proposed, and an EPN model transforming algorithm from ECA rules is designed also. Based on the EPN model, termination analysis on ECA rules is investigated, and an effective static termination analysis algorithm is designed. The composite events and composite conditions are deeply analyzed in the algorithm. Comparing with current algorithms, the proposed algorithm has higher accuracy and usability. Key words: ECA rules; Petri nets; inhibitor arcs; test arcs; t

您可能关注的文档

文档评论(0)

1亿VIP精品文档

相关文档