The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.08 - August (1974 vol.23)
pp: 874-877
R.T. Boute , Technical Staff, Bell Telephone Manufacturing Company
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.
INDEX TERMS
Checking experiments, distinguishing sequences, distinguishing sets, fault detection, machine identification, sequential machines, state identification, transition check status table, transition verification.
CITATION
R.T. Boute, "Distinguishing Sets for Optimal State Identification in Checking Experiments", IEEE Transactions on Computers, vol.23, no. 8, pp. 874-877, August 1974, doi:10.1109/T-C.1974.224043
7 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool