关键词: 故障分析, 故障行为, 基于模型的诊断, 极小诊断, 集合枚举树

Abstract: A new method using failure behavior to resolve all minimal diagnoses, and the computation procedure was formalized by combining revised Set Enumeration tree (SE-tree) with closed nodes to produce all the resolutions gradually. It could directly compute all the minimal diagnoses without computing all the conflict sets and therefore the hitting sets of the collection of the corresponding conflict sets like the classical methods. And then the combinatorial explosion caused by calling Assumption-based Truth Maintenance System (ATMS), known as an NP-complete problem, could be avoided as well. As the closed nodes were added to the SE-tree, the non-minimal diagnoses could never be produced, and the true resolutions could not be missed by pruning, either. Results showed that the corresponding algorithm could be easily implemented, the efficiency was greatly improved and real-time requirements for complicated diagnosed objects were satisfied.

Key words: failure analysis, failure behavior, model-based diagnosis, minimal diagnosis, set enumeration tree