Title :
Diagnosis of Faults in Linear Tree Networks
Author :
Seth, Sharad C. ; Kodandapani, K.L.
Author_Institution :
Department of Computer Science, University of Nebraska, Lincoln, NE 68588; I.I.T. Kanpur, Kanpur, India
Abstract :
The problem of fault detection and location in tree networks of two input EXCLUSIVE-OR (EOR) gates is considered. The fault model assumes that an EOR gate can change to any other function of its two inputs except the equivalence function. An efficient procedure for single fault location is presented. In the worst case the number of tests necessary to locate single faults is bounded by a linear function of the number of input variables. Constructive upper bounds are obtained for the number of tests to detect multiple faults. Optimality of these bounds is argued and extension of results to other types of networks is considered.
Keywords :
Decoding; Encoding; Fault detection; Fault diagnosis; Fault location; Input variables; Logic functions; Logic testing; Upper bound; Vectors; Fault detection and location; linear tree networks; multiple faults; optimum test sets;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1977.5009270