DocumentCode :
1112397
Title :
Algorithms ror Designing Fault-Detection Experiments ror Sequential Machines
Author :
Farmer, Daniel E.
Author_Institution :
Department of Electrical and Computer Engineering, Clarkson College of Technology
Issue :
2
fYear :
1973
Firstpage :
159
Lastpage :
167
Abstract :
In this paper we present algorithms for designing fault-detection experiments for sequential machines with special emphasis on the case in which the machine does not possess a distinguishing sequence. The length of an experiment is reduced through: 1) identifying each state with its own unique input/output set rather than using a common set for all states; 2) utilizing overlapping of the required input/output sequences so that a portion of the experiment serves more than one purpose; and 3) verifying the reference condition in which the machine is placed at many points in the experiment by as short a locating sequence as possible. Important distinctions are made between locating sequences of the type introduced in previous work and those defined and used here.
Keywords :
Characterizing sequence, distinguishing sequence, fault-detection experiments, locating sequence, sequential machine.; Algorithm design and analysis; Fault diagnosis; Helium; Upper bound; Characterizing sequence, distinguishing sequence, fault-detection experiments, locating sequence, sequential machine.;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/T-C.1973.223678
Filename :
1672271
Link To Document :
بازگشت