On the complexity of dynamic tests for logic functions

Abstract

A generalization of the concept of dynamic test is proposed for detecting logic and parametric faults at input / output terminals of logic networks realizing k— valued logic functions (k > 2). Upper and lower bounds on the complexity (i.e., length) of minimal dynamic tests are obtained for various classes of logic functions

    Similar works