Minimum verification test set for combinational circuit

Abstract

A sufficient condition under which a minimum verification test set (MVTS) for a combinational circuit has 2/sup w/ elements is derived, where w is the maximum number of inputs on which any output depends, and an algorithm to find an NVTS with 2/sup w/ elements for any CUT with up to four outputs is described.<>