Application of Information Theory to Sequential Fault Diagnosis

1 February 1982

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers

Vol. C-31 (2) , 164-170
https://doi.org/10.1109/tc.1982.1675963

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

This publication has 12 references indexed in Scilit:

Sequential Fault Diagnosis in Combinational Networks
IEEE Transactions on Computers, 1977
Constructing optimal binary decision trees is NP-complete
Information Processing Letters, 1976
Fault Diagnosis in Combinational Tree Networks
IEEE Transactions on Computers, 1975
Information theory applied to the conversion of decision tables to computer programs
Communications of the ACM, 1973
A New Approach to the Fault Location of Combinational Circuits
IEEE Transactions on Computers, 1972
Fault Testing and Diagnosis in Combinational Digital Circuits
IEEE Transactions on Computers, 1968
A distinguishability criterion for selecting efficient diagnostic tests
Published by Association for Computing Machinery (ACM) ,1968
On an Improved Diagnosis Program
IEEE Transactions on Electronic Computers, 1965
A Measure of Efficiency of Diagnostic Tests Upon Sequential Logic
IEEE Transactions on Electronic Computers, 1964
Diagnosis of Equipment Failures
IRE Transactions on Reliability and Quality Control, 1960