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.;
