DocumentCode :
1145789
Title :
Application of Information Theory to Sequential Fault Diagnosis
Author :
Varshney, Pramod K. ; Hartmann, Carlos R P ; De Faria, Jamie M., Jr.
Author_Institution :
Department of Electrical and Computer Engineering, Syracuse University
Issue :
2
fYear :
1982
Firstpage :
164
Lastpage :
170
Abstract :
In this correspondence we consider the problem of the construction of efficient sequential fault location experiments for permanent faults. The construction of optimum sequential experiments is an NP-complete problem and, therefore, a heuristic approach for the design of near-optimum sequential experiments is considered. The approach is based on information theoretic concepts and the suggested algorithm for the construction of near-optimum sequential fault location experiments is systematic, has a sound theoretical justification, and yet has low design complexity.
Keywords :
Binary decision trees; fault diagnosis; fault location; fault-tolerant computing; information theory; sequential experiments; Art; Computer networks; Concurrent computing; Fault diagnosis; Indium tin oxide; Information theory; Multiprocessor interconnection networks; Programming; Binary decision trees; fault diagnosis; fault location; fault-tolerant computing; information theory; sequential experiments;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/TC.1982.1675963
Filename :
1675963
Link To Document :
بازگشت