Computer Science and Engineering, Department of


Document Type


Date of this Version



Published in IEEE TRANSACTIONS ON COMPUTERS, VOL. C-26, NO. 1, JANUARY 1977, pp. 29-33. Copyright 1977 IEEE. Used by permission.


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.