Optimal Test Generation in Combinational Networks by Pseudo-Boolean Programming

1 June 1977

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers

Vol. C-26 (6) , 553-560
https://doi.org/10.1109/tc.1977.1674880

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.

Keywords

This publication has 3 references indexed in Scilit:

On the Maximization of a Pseudo-Boolean Function
Journal of the ACM, 1972
Analyzing Errors with the Boolean Difference
IEEE Transactions on Computers, 1968
On Finding a Nearly Minimal Set of Fault Detection Tests for Combinational Logic Nets
IEEE Transactions on Electronic Computers, 1966