DocumentCode
1116140
Title
Distinguishing Sets for Optimal State Identification in Checking Experiments
Author
Boute, Raymond T.
Author_Institution
Technical Staff, Bell Telephone Manufacturing Company
Issue
8
fYear
1974
Firstpage
874
Lastpage
877
Abstract
A new concept, called distinguishing set or D-set is presented. Its use yields a considerable reduction in the length of checking sequences. Arbitrarily chosen examples have indicated a reduction of 30-50 percent. It is shown that the sequences of a distinguishing set actually constitute the optimum, i.e., minimum length, for state identification through input-output observations only.
Keywords
Checking experiments, distinguishing sequences, distinguishing sets, fault detection, machine identification, sequential machines, state identification, transition check status table, transition verification.; Design optimization; Digital systems; Fault detection; Fault diagnosis; Manufacturing; Telephony; Checking experiments, distinguishing sequences, distinguishing sets, fault detection, machine identification, sequential machines, state identification, transition check status table, transition verification.;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/T-C.1974.224043
Filename
1672636
Link To Document