无回路规则系统的Petri网验证方法  

Verifying Acyclic Rule-Based System by Petri Nets

作　　者：丁志军[1] 潘美芹[2] 蒋昌俊[1] 韩耀军[1] 

机构地区：[1]同济大学计算机科学与工程系,上海200092 [2]山东科技大学信息科学与工程学院,山东青岛266510

出　　处：《同济大学学报（自然科学版）》2007年第2期232-238,共7页Journal of Tongji University:Natural Science

基　　金：国家"九七三"重点基础研究发展规划资助项目(2003CB317002);国家自然科学基金资助项目(60534060;60473094;90612006)

摘　　要：构建了无回路规则系统的加标ω-Petri网模型,产生了相应的可达树,利用可达状态反映规则系统所包含的所有可达关系,并记录;提出了可达状态的反向推演森林及其算法,实现规则系统命题间可达路径的显式化.在此基础上,给出了规则系统错误的判定定理及其检测算法,实现了结构错误的有效判定和分析.A series of Petrinet-based definitions are formulated for describing four types of structural errors in a rule-based system （RBS）, including inconsistency, incompleteness, redundancy and circularity. A marked ω-Petri net model of acyclic RBS is constructed, and then its reachability tree is generated to record all reachable relations between propositions in RBS. Moreover, a backward reasoning forest of a reachable marking is generated for explicitly representing reachable paths in RBS. Finally, theorems and algorithms are provided to analyze and check structural errors. The applicability of the research results is illustrated by an example.

关 键 词：规则系统 HORN子句 PETRI网 验证 

分 类 号：TP182[自动化与计算机技术—控制理论与控制工程]