Fault Diagnosis in Combinational Tree Networks

  • Authors:
  • Z. Kohavi;I. Berger

  • Affiliations:
  • Department of Computer Science, University of Utah;-

  • Venue:
  • IEEE Transactions on Computers
  • Year:
  • 1975

Quantified Score

Hi-index 14.98

Visualization

Abstract

In this paper, which is a follow up to [8], we are concerned with the problem of generating minimal experiments to locate and diagnose faults in combinational tree networks. We establish lower bounds on the necessary number of fault-locating tests and show how, in a systematic way, such experiments can be obtained. Two types of testing procedures are considered adaptive and preset.