The Complexity of Trie Index Construction
Journal of the ACM (JACM)
Information theory applied to the conversion of decision tables to computer programs
Communications of the ACM
Switching and Finite Automata Theory: Computer Science Series
Switching and Finite Automata Theory: Computer Science Series
Information Theory and Reliable Communication
Information Theory and Reliable Communication
A New Approach to the Fault Location of Combinational Circuits
IEEE Transactions on Computers
Fault Testing and Diagnosis in Combinational Digital Circuits
IEEE Transactions on Computers
Sequential Fault Diagnosis in Combinational Networks
IEEE Transactions on Computers
Fault Diagnosis in Combinational Tree Networks
IEEE Transactions on Computers
A distinguishability criterion for selecting efficient diagnostic tests
AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
Sequential Fault Diagnosis of Modular Systems
IEEE Transactions on Computers
| Hi-index | 14.98 |
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.