J4

• 计算机科学 • 上一篇    下一篇

可用于诊断产生的计算碰集的新方法

赵相福, 欧阳丹彤   

  1. 吉林大学 计算机科学与技术学院, 长春 130012; 吉林大学 符号计算与知识工程教育部重点实验室, 长春 130012
  • 收稿日期:2005-04-07 修回日期:1900-01-01 出版日期:2006-05-26 发布日期:2006-05-26
  • 通讯作者: 欧阳丹彤

A New Method of Computing Hitting Sets Applied to Diagnosis Generation

ZHAO Xiang-fu, OUYANG Dan-tong   

  1. College of Computer Science and Technology, Jilin University, Changchun 130012, China; Key Laboratory ofSymbolic Computation and Knowledge Engineering of Ministry of Education, Jilin University, Changchun 130012, China
  • Received:2005-04-07 Revised:1900-01-01 Online:2006-05-26 Published:2006-05-26
  • Contact: OUYANG Dan-tong

摘要: 提出一种利用与元素相关联的冲突集个数计算碰集的新方法, 并结合带有终止节点的集合枚举树SEtree形式化地表达计算过程, 逐步生成所有的极小碰集. 由于在SEtree中添加了终止节点, 因而能够较大提高搜索效率. 实验结果表明, 该算法程序容易编制, 且效率较好, 对于复杂的被诊断对象系统可以满足实时性.

关键词: 基于模型诊断, 冲突集, 极小碰集, 集合枚举树

Abstract: A new method is proposed to compute hitting sets by using the number of conflict sets corresponding to the components. Furthermore, the computing procedure is formalized by combining SE\|tree with closed nodes to generate all the minimal hitting sets. Since closed nodes are added into SE\|tree, the search efficiency is highly improved. The program is easy to realize, and the algorithm can improve the diagnosis efficiency to satisfy real-time requirement even for a complex system.

Key words: modelbased diagnosis, conflict set, minimal hitting set, set enumeration tree

中图分类号: 

  • TP306