DocumentCode
1466195
Title
Counting two-state transition-tour sequences
Author
Saxena, Nirmal R. ; McCluskey, Edward J.
Author_Institution
Center for Reliable Comput., Stanford Univ., CA, USA
Volume
45
Issue
11
fYear
1996
fDate
11/1/1996 12:00:00 AM
Firstpage
1337
Lastpage
1342
Abstract
This paper develops a closed-form formula, f(k), to count the number of transition-tour sequences of length k for bistable machines. It is shown that the function f(k) is related to Fibonacci numbers. Some applications of the results in this paper are in the areas of testable sequential machine designs, random testing of register data paths, and qualification tests for random pattern generators
Keywords
logic testing; sequential machines; Fibonacci numbers; bistable machines; checking experiments; qualification tests; random pattern generators; random testing; register data paths; sequential machine testing; testable sequential machine designs; testable synthesis; transition-tours; two-state transition-tour sequences; Automata; Binary sequences; Clocks; Flip-flops; Qualifications; Registers; Sequential analysis; Terminology; Test pattern generators; Testing;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/12.544493
Filename
544493
Link To Document