Issue No.02 - February (1982 vol.31)
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.
sequential experiments, Binary decision trees, fault diagnosis, fault location, fault-tolerant computing, information theory
C.R.P. Hartmann, J.M., Jr. De Faria, "Application of Information Theory to Sequential Fault Diagnosis", IEEE Transactions on Computers, vol.31, no. 2, pp. 164-170, February 1982, doi:10.1109/TC.1982.1675963