Diagnosis of Faults in Linear Tree Networks
- 1 January 1977
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-26 (1) , 29-33
- https://doi.org/10.1109/tc.1977.5009270
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
This publication has 6 references indexed in Scilit:
- Diagnosis of Faults in Linear Tree NetworksIEEE Transactions on Computers, 1977
- Test Point Placement to Simplify Fault DetectionIEEE Transactions on Computers, 1974
- Easily testable realizations for logic functions: Iowa University, Maths Dept., Iowa City, USA (June 1972) 35ppComputer-Aided Design, 1973
- Easily Testable Realizations ror Logic FunctionsIEEE Transactions on Computers, 1972
- Generation of Fault Tests for Linear Logic NetworksIEEE Transactions on Computers, 1972
- On Realizations of Boolean Functions Requiring a Minimal or Near-Minimal Number of TestsIEEE Transactions on Computers, 1971