The Boolean Difference and Multiple Fault Analysis
- 1 January 1975
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-24 (1) , 62-71
- https://doi.org/10.1109/T-C.1975.224083
Abstract
The Boolean difference is a well-known mathematical concept which has found significant application in the single fault analysis of combinational logic circuits. One of the primary attributes of the Boolean difference in such situations is its completeness. In this paper we extend the Boolean difference concept to cover multiple fault situations. Expressions are developed which give all possible input patterns that can be applied to combinational logic circuits to demonstrate the presence or absence of a specified multiple fault of the stuck-type class. Such expressions are useful in situations where at most, say, p simultaneous faults need be considered, as well as situations where any multiple fault can exist. In addition the expressions developed are also shown to complete some existing single fault analysis concepts.Keywords
This publication has 7 references indexed in Scilit:
- Boolean Difference Calculus and Fault FindingSIAM Journal on Applied Mathematics, 1973
- Path Sensitization, Partial Boolean Difference, and Automated Fault DiagnosisIEEE Transactions on Computers, 1972
- Multiple Fault Detection in Combinational NetworksIEEE Transactions on Computers, 1972
- On the Design of Multiple Fault Diagnosable NetworksIEEE Transactions on Computers, 1971
- An Efficient Algorithm for Generating Complete Test Sets for Combinational Logic CircuitsIEEE Transactions on Computers, 1971
- Analyzing Errors with the Boolean DifferenceIEEE Transactions on Computers, 1968
- On a Theory of Boolean FunctionsJournal of the Society for Industrial and Applied Mathematics, 1959