The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - April (1980 vol.29)
pp: 288-299
V.K. Agarwal , Department of Electrical Engineering, McGill University
ABSTRACT
Given any combinational, internal fan-out-free network and any complete single fault detection test set (SFDTS) for the network, we consider in this paper the problem of determining the minimal extent to which that SFDTS will cover multiple faults in the network. The basis of our approach is the development of a generic perspective to multiple faults which uses a representation of such faults called an L-expression. This perspective leads to a technique for obtaining the greatest lower bound on the multiple fault coverage capability of an SFDTS by means of a simple table look-up process. In addition to generalizing previously known results regarding multiple fault coverage, two particularly interesting results obtained from this approach are as follows: 1) On the average, every SFDTS for an internal fan-out-free network covers 92 percent of all multiple faults of sizes 8 and less. 2) On the average, every SFDTS for an internal fan-out-free network covers at least 46.1 percent of all multiple faults.
INDEX TERMS
single and multiple fault detection, Coverage bounds, coverage table, fault vectors, generic representations, L-expressions, internal fan-out-free networks
CITATION
V.K. Agarwal, G.M. Masson, "Generic Fault Characterizations for Table Look-Up Coverage Bounding", IEEE Transactions on Computers, vol.29, no. 4, pp. 288-299, April 1980, doi:10.1109/TC.1980.1675567
47 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool