Universal test sets for logic networks
- 1 October 1972
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
This paper examines the problem of finding a single universal test set that will test any of a variety of different implementations of a given switching function. It is shown that, for and/or networks, universal test sets may be found which detect not only all single faults but all multiple faults as well. The minimality and size of these sets are examined and their derivation for incomplete and multiple-output functions is described. The extension of these results to other network types is discussed.Keywords
This publication has 9 references indexed in Scilit:
- Derivation of Minimum Test Sets for Unate Logical CircuitsIEEE Transactions on Computers, 1971
- Minimal Sets of Distinct Literals for a Logically Passive FunctionJournal of the ACM, 1971
- Programmed Algorithms to Compute Tests to Detect and Distinguish Between Failures in Logic CircuitsIEEE Transactions on Electronic Computers, 1967
- On Finding a Nearly Minimal Set of Fault Detection Tests for Combinational Logic NetsIEEE Transactions on Electronic Computers, 1966
- A Catalog of Three-Variable Or-Invert and And-Invert Logical CircuitsIEEE Transactions on Electronic Computers, 1963
- A Truth Table Method for the Synthesis of Combinational LogicIRE Transactions on Electronic Computers, 1961
- Unate Truth FunctionsIEEE Transactions on Electronic Computers, 1961
- Lattice Theoretic Properties of Frontal Switching FunctionsJournal of Mathematics and Physics, 1954
- Ein Satz ber Untermengen einer endlichen MengeMathematische Zeitschrift, 1928