On Closedness and Test Complexity of Logic Circuits
- 1 August 1981
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-30 (8) , 556-562
- https://doi.org/10.1109/tc.1981.1675840
Abstract
The concept of closedness of a set of logic functions under stuck-type faults is introduced. All sets of logic functions closed under stuck-type faults are classified. For the sets of logic functions closed under stuck-type faults, the test complexity and the universal test sets are considered. It is shown that for each class of linear functions, OR functions, and AND functions, both the minimum numbers of multiple fault detection tests and multiple fault location tests are exactly n + 1, where n is the number of inputs of the circuits, and that there exists universal test sets with n + 1 tests to detect and locate all multiple faults in such circuits.Keywords
This publication has 7 references indexed in Scilit:
- Diagnosis of Faults in Linear Tree NetworksIEEE Transactions on Computers, 1977
- Complete Test Sets for Logic FunctionsIEEE Transactions on Computers, 1973
- Universal Test Sets for Logic NetworksIEEE Transactions on Computers, 1973
- Derivation of Minimal Test Sets for Monotonic Logic CircuitsIEEE Transactions on Computers, 1973
- Generation of Fault Tests for Linear Logic NetworksIEEE Transactions on Computers, 1972
- On Realizations of Boolean Functions Requiring a Minimal or Near-Minimal Number of TestsIEEE Transactions on Computers, 1971
- Derivation of Minimum Test Sets for Unate Logical CircuitsIEEE Transactions on Computers, 1971