Fault Detection of Binary Sequential Machines Using R-Valued Test Machines
- 1 April 1974
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-23 (4) , 352-358
- https://doi.org/10.1109/T-C.1974.223949
Abstract
An improved method for detection of faults in completely specified synchronous sequential machines is described. The technique is algorithmic, based on the concept of embedding the given binary machine into an easily testable R-valued machine. Heuristic optimization of additional permutation inputs is shown to lead to considerable reduction in the length of the fault sequence. A bound on the sequence length is derived, which in most cases is significantly lower than those of comparable methods.Keywords
This publication has 7 references indexed in Scilit:
- On an extended threshold logic as a unit cell of array logicsPublished by Association for Computing Machinery (ACM) ,1972
- On the design of easily testable sequential machinesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1971
- General Shift-Register Sequences of Arbitrary Cycle LengthIEEE Transactions on Computers, 1971
- Sequential Machines Capable of Fault DiagnosisIEEE Transactions on Computers, 1970
- A Method for the Design of Fault Detection ExperimentsIEEE Transactions on Computers, 1970
- Design of Sequential Machines with Fault-Detection CapabilitiesIEEE Transactions on Electronic Computers, 1967
- Fault detecting experiments for sequential circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1964