Optimal Test Generation in Combinational Networks by Pseudo-Boolean Programming

The problem of generating tests for the detection or location of permanent logical faults in combinational networks is formulated as a finite sequence of maximization problems in which the maximizing vertices are the desired tests. The formulation is based on the concept of real transform of a Boolean function, while maximization is achieved by pseudo-Boolean PB programming.