An Improved Bound on the Length of Checking Experiments for Sequential Machines with Counter Cycles

Authors:
C. E. Holborow
Affiliations:
Department of Electrical Engineering, The Johns Hopkins University, Baltimore, Md. 21218.
Venue:
IEEE Transactions on Computers
Year:
1972

Citing 0
Cited 5

Design of Diagnosable Sequential Machines Utilizing Extra Outputs

IEEE Transactions on Computers
On a Novel Approach of Fault Detection in an Easily Testable Sequential Machine with Extra Inputs and Extra Outputs

IEEE Transactions on Computers
Easily Testable Sequential Machines with Extra Inputs

IEEE Transactions on Computers
Signature Testing of Sequential Machines

IEEE Transactions on Computers
Pseudo-exhaustive testing of sequential machines using signature analysis

ITC'84 Proceedings of the 1984 international test conference on The three faces of test: design, characterization, production

Quantified Score

Hi-index	15.00

Visualization

Abstract

The bound on the length of checking experiments derived by Murakami et al. [1] is improved by using a more efficient output specification in the counter cycle.