间接可测端点可信性的拓扑条件和算法

Reliability of Topological Condition for Indirectly Accessible Terminals and Its Algorithm

模拟电路子网络级故障诊断理论，面临着二个基础性核心问题：（１）撕裂端点是否要全部可及，（２）子网络级故障可诊断性的条件是什么？本文给出的定理回答了这些问题．

In the diagnosis of faulty anolog circuits at subnetwork-leyel, there are two essential core problems: (1 ) Is it necessary that all the torn nodes are accessible? (2) Is there a condition that the fault at subnetwork-level can be self-testing? A theorem is presented here to solve the above two problems. The condtions given are necessary and almost sufficient.