基于集合递推运算的最小hitting集算法  

Minimal hitting set algorithm based on set iteration

作　　者：傅绍文[1] 董健康[1] 

机构地区：[1]中国民航学院机电工程学院,天津300300

出　　处：《哈尔滨工业大学学报》2004年第8期1084-1086,共3页Journal of Harbin Institute of Technology

基　　金：中国民航总局科技基金资助项目(2002703).

摘　　要：提出一种最小hitting集算法,以满足基于模型故障诊断中诊断解的计算.采用集合递推运算计算了最小hitting集合,并证明了该算法可得到最小冲突集合组的全部最小hitting集合.实验表明,该算法程序容易编制、运算迅速快,可以明显地提高诊断效率,对于复杂的被诊断对象系统可以满足实时性要求.A method of calculating minimal hitting sets is proposed and its correctness is proved. Using this method, it will be easier to determine all the real faults from candidates in fault diagnosis based on model. Because this algorithm only deals with the operation between two sets, it is simple, effective and has less computation burden and the program is easy to realize. This algorithm can improve the diagnosis efficiency to satisfy real-time requirement, especially for a complex system.

关 键 词：故障诊断 模型诊断 最小冲突集 最小hitting集 集合递推运算 

分 类 号：TP277[自动化与计算机技术—检测技术与自动化装置]