摘要
本文根据Huang Z F等提出的模拟电路故障拓朴可测条件,建立了拓扑可测性设计问题的图论模型并给出了一种简便算法,讨论了可测性分析的方法并证明了对使用撕裂法处理大网络十分有用的主子网可测性关系定理。
According to the topological condition on the fault testability of analog circuits given by Huang Z F etc., this paper estab- lishes a model of testability design in graph theory and pre- sents a simple algorithm, discusses the method of testability analysis and proves a main-sub network testability relation theorem which is very useful for applying the decomposition method to handle large networks.
出处
《西南交通大学学报》
EI
CSCD
北大核心
1992年第2期102-107,共6页
Journal of Southwest Jiaotong University
关键词
模拟电路
图论
故障诊断
可测性
analasis circuit
graph theory
fault diagnosis
testability