Algebraic Fault Analysis for Constrained Combinational Networks
- 1 February 1971
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-20 (2) , 141-148
- https://doi.org/10.1109/T-C.1971.223203
Abstract
A sequential machine that processes its inputs without changing state can be represented as a constrained combinational network. A system of Boolean equations that represent such a network must include assertions that formalize the required constraints. These constraints can be expressed as assertions about certain gate inputs and certain gate outputs within the network. In such networks, redundant and partially redundant gates are not pathological. The fault analysis method presented provides for the testing of both sides of an irredundant gate and for the detectable side of a partially redundant gate.Keywords
This publication has 6 references indexed in Scilit:
- Correction to "Analyzing Errors with the Boolean Difference"1IEEE Transactions on Computers, 1969
- Analyzing Errors with the Boolean DifferenceIEEE Transactions on Computers, 1968
- Programmed Algorithms to Compute Tests to Detect and Distinguish Between Failures in Logic CircuitsIEEE Transactions on Electronic Computers, 1967
- On the Necessity to Examine D-Chains in Diagnostic Test Generation—An Example [Letter to the Editor]IBM Journal of Research and Development, 1967
- Diagnosis of Automata Failures: A Calculus and a MethodIBM Journal of Research and Development, 1966
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965