摘要
提出一种利用与元素相关联的冲突集个数计算碰集的新方法,并结合带有终止节点的集合枚举树SE-tree形式化地表达计算过程,逐步生成所有的极小碰集.由于在SE-tree中添加了终止节点,因而能够较大提高搜索效率.实验结果表明,该算法程序容易编制,且效率较好,对于复杂的被诊断对象系统可以满足实时性.
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.
出处
《吉林大学学报（理学版）》
CAS
CSCD
北大核心
2006年第3期385-390,共6页
Journal of Jilin University:Science Edition
基金
国家自然科学基金重大项目基金(批准号:60496320
60496321)
国家高技术研究发展计划项目基金(批准号:2003AA118020)
新世纪优秀人才支持计划项目基金.
关键词
基于模型诊断
冲突集
极小碰集
集合枚举树
model-based diagnosis
conflict set
minimal hitting set
set enumeration tree
