Diagnosis of constant faults in iteration-free circuits over monotone basis
We show that for each iteration-free combinatorial circuit S S over a basis B B containing only monotone Boolean functions with at most five variables, there exists a decision tree for diagnosis of constant faults on inputs of gates with depth at most 7L(S) 7 L ( S ) where L(S) L ( S ) is the number of gates in S S .
constant faults iteration-free circuits monotone boolean functions decision trees