Translation of the problem of complete test set generation to pseudo-Boolean programming

An attempt is made to demonstrate that the problem of complete test set generation is amenable to the problem of pseudo-Boolean programming. For this purpose, various types of faults, viz., single faults, multiple faults, and bridging faults, are considered. The key issue is to obtain logical expressions for the primary output line in terms of different faulty internal nodes to find real transforms. Using standard rules, the real transforms of a Boolean function can be obtained directly without any algebraic manipulation