The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.11 - November (1977 vol.26)
pp: 1170-1175
V.K. Agarwal , Department of Electrical Engineering, The Johns Hopkins University
ABSTRACT
This correspondence considers fault resolution as a process of applying a sequence of input vectors, called tests, to a combinational logic network in order to resolve an existing fault situation from within a given master set of faults. A functional approach based upon an extension of the well-known Boolean difference concept to fault dependent situations is described. The test sets resulting from this extension, called fault dependent test sets, are fundamental to our considerations and are shown to be obtainable in a straightforward manner from standard test sets. Two fault interrelationships are defined which are particularly relevant to the resolution problem in that they algebraically describe the inherent limitations to the degree to which the existing fault situation can be resolved from within a given master set of faults using algebraic terminal experiments and fault dependent testing. Because these interrelationships are defined from a resolution-oriented point of view, they can be seen to be somewhat more intimate than other fault interrelationships which have been previously described in the literature. Some important ramifications of these interrelationships are discussed.
INDEX TERMS
Boolean difference, combinational logic networks, complete masking, fault dependent Boolean difference, fault dependent testing, fault interrelationships, fault resolution, functional equivalence, multiple fault analysis, unresolvability.
CITATION
V.K. Agarwal, G.M. Masson, "Resolution-Oriented Fault Interrelationships in Combinational Logic Networks", IEEE Transactions on Computers, vol.26, no. 11, pp. 1170-1175, November 1977, doi:10.1109/TC.1977.1674771
23 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool