| 间接可测端点可信性的拓扑条件和算法 |
| |
| 引用本文： | 黄东泉,叶风,杨祖樱.间接可测端点可信性的拓扑条件和算法[J].福州大学学报(自然科学版),1989(4):36-40. |
| |
| 作者姓名： | 黄东泉 叶风 杨祖樱 |
| |
| 作者单位： | 福州大学电气系
(黄东泉，叶风)，福州大学电气系(杨祖樱) |
| |
| 基金项目： | 国家自然科学基金资助项目． |
| |
| 摘 要： | 模拟电路子网络级故障诊断理论，面临着二个基础性核心问题：（１）撕裂端点是否要全部可及，（２）子网络级故障可诊断性的条件是什么？本文给出的定理回答了这些问题．这条件是必要的和几乎充分的
|
| 关 键 词： | 子网络级故障 n端子网络 |
Reliability of Topological Condition for Indirectly Accessible Terminals and Its Algorithm |
| |
| Huang Dongquan Ye Feng Yan,Zuying.Reliability of Topological Condition for Indirectly Accessible Terminals and Its Algorithm[J].Journal of Fuzhou University(Natural Science Edition),1989(4):36-40. |
| |
| Authors: | Huang Dongquan Ye Feng Yan Zuying |
| |
| Institution: | Department of Electrical Engineering |
| |
| Abstract: | 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. |
| |
| Keywords: | fault at subnetwork-level n-terminals subnetwork |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《福州大学学报(自然科学版)》浏览原始摘要信息 |
| 点击此处可从《福州大学学报(自然科学版)》下载免费的PDF全文 |
