Using Petri nets to verify acyclic rule-based system |
| |
| Authors: | Zhijun Ding Meiqin Pan Changjun Jiang Yaojun Han |
| |
| Affiliation: | (1) College of Information Science and Engineering, Shandong University of Science and Technology, Qingdao, 266510, China;(2) Department of Computer Science and Engineering, Tongji University, Shanghai, 201804, China |
| |
| Abstract: | A series of Petri net-based definitions were 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 was constructed. Then, its reachability tree was generated to record all reachable relations between propositions in RBS. Moreover, a backward reasoning forest of a reachable marking was generated for explicitly representing reachable paths in RBS. Finally, a set of theorems and algorithms were provided to analyze and check structural errors. The usability of the research results presented in this paper was illustrated by an example. __________ Translated from Journal of Tongji University (Natural Science), 2007, 35(2): 232–238 [译自: 同济大学学报(自然科学版)] |
| |
| Keywords: | rule-based system (RBS) horn clause Petri net verification |
| 本文献已被 万方数据 SpringerLink 等数据库收录！ |
|
