On computing the detection probability of stuck-at faults in a combinational circuit

Abstract

In the context of random testing and testability analysis of combinatorial circuits, the author presents a reduced-search-space method for computing the exact detection probability of stuck-at faults. The proposed method is simple, search-oriented, and subexponential in the number of input variables of the circuit. A Prolog implementation is given.<>