摘要
本文提出了基于互测BGM故障模型的系统级故障诊断集团算法的理论,定义了绝对故障和最终诊断图,由此能找到所有基于互测BGM故障模型的相容故障模式,即使不满足t 可诊断性,也大大减少了系统级故障诊断的复杂度,尤其是对强t 可诊断系统。
This paper presents the theory of node grouping algorithms for the systemlevel fault diagnosis of the BGM model based on mutual testing, defines the absolute fault and last diagnosis chart, so all the consistent fault patterns (CFP) can be found, even if the condition of tdiagnosability is not satisfied. Specially, the complexity of systemlevel fault diagnosis can be greatly decreased, especially in strong tdiagnosable systems.
出处
《计算机工程与科学》
CSCD
2003年第4期75-76,107,共3页
Computer Engineering & Science
基金
国家自然科学基金资助项目(69973016)
关键词
多处理机系统
系统级故障诊断
集团算法
BGM
T-可诊断性
BGM model based on mutual testing
node grouping algorithm
system-level fault diagnosis
consistent fault pattern (CFP)
absolute fault
last diagnosis chart
strong t-diagnosable