Optimal Test Generation in Combinational Networks by Pseudo-Boolean Programming

Authors:
S. G. Papaioannou
Affiliations:
College of Engineering, Boston University
Venue:
IEEE Transactions on Computers
Year:
1977

Citing 2
Cited 1

On the Maximization of a Pseudo-Boolean Function

Journal of the ACM (JACM)
Analyzing Errors with the Boolean Difference

IEEE Transactions on Computers

Design for Testability A Survey

IEEE Transactions on Computers

Quantified Score

Hi-index	14.98

Visualization

Abstract

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.