Heuristic Search in Digital System Diagnosis

Conference paper


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.

Unable to display preview. Download preview PDF.


  1. 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
  2. Hart, P.E., Nilsson, N.J. and B. Raphael. (1968) A Formal Basis for the Heuristic Determination of Minimum Cost Paths. IEEE Trans. Sys. Science and Cybernetics, SSC-4(2):100–107.CrossRefGoogle Scholar
  3. Nilsson, N.J. (1971) Problem-Solving Methods in Artificial Intelligence. New York: McGraw-Hill.Google Scholar
  4. Pearl, J. (1984) Heuristics: Intelligent Search Strategies for Computer Problem Solving. Reading, Mass: Addison-Wesley.Google Scholar
  5. Patil, S. (1979) A Programmable Logic Approach for VLSI. IEEE Trans. Computer, C-28(9):594–601.CrossRefGoogle Scholar
  6. Smith, K.F., Carter, T.M. and C.E. Hunt. (1982) Structured Logic Design of Integrated Circuits Using the Storage/Logic Array (SLA). IEEE Trans. Electron Devices, ED-29(4):765–776.CrossRefGoogle Scholar
  7. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Tao Li
    • 1
  1. 1.Department of Electrical EngineeringBrigham Young UniversityProvoUSA

Personalised recommendations