摘要
该文改进了基于互测PMC模型的系统级故障诊断集团算法的理论 ,通过定义集团测试边和绝对故障集 ,简化了集团诊断图 ,由此能较易地找到所有的基于互测PMC模型的相容故障模式 (即使不满足t-可诊断性 ) ,从而大大减少了系统级故障诊断的复杂度 ,尤其是对强t-可诊断系统。
This article improves on the theory of Node Grouping Algorithms in System-level Fault Diagnosis of PMC Model Based on Ex-test. By defining the Group's testing edge and the absolute fault sets, the Group diagnosis chart is simplified ,so all the CFP of PMC model based on ex-test can be easily found even if the condition of the t-diagnosable isn't satisfied. Hence the complexity of system fault diagnosis is greatly decreased, especially in the strong t-diagnosable system.
出处
《计算机仿真》
CSCD
2003年第6期47-49,共3页
Computer Simulation
关键词
系统级故障诊断集团算法
相容故障模式
PMC模型
集团诊断图
Node grouping algorithms
Absolute fault sets
Group diagnosis chart
System-level fault diagnosis
Consistent fault patterns(CFP)