Heuristic Search in Digital System Diagnosis
In this paper heuristic algorithms are devised for locating faults in sequential circuits. The concepts of location trees and generalized homing trees (GHTs) are introduced. Heuristic rules are employed in the algorithms for node pruning. Results are also derived for the upper- and lower-bounds on the lengths of test sequences.
Unable to display preview. Download preview PDF.
- Poage, J.F. and E.J. McCluskey. (1964) Derivation of Optimum Test Sequences for Sequential Machines. Proc. of 5th Annu. Symp. Swithing Theory and Logic Design, pp 95–110, IEEE.Google Scholar
- Nilsson, N.J. (1971) Problem-Solving Methods in Artificial Intelligence. New York: McGraw-Hill.Google Scholar
- Pearl, J. (1984) Heuristics: Intelligent Search Strategies for Computer Problem Solving. Reading, Mass: Addison-Wesley.Google Scholar
- Li, T. (1984) Fault Diagnosis and Design-for-Testability of Integrated Sequential Circuits. Ph.D Dissertation, Dept. of Computer Science, Univ. of Utah.Google Scholar