Distinguishing Sets for Optimal State Identification in Checking Experiments

Authors:
R. T. Boute
Affiliations:
Technical Staff, Bell Telephone Manufacturing Company
Venue:
IEEE Transactions on Computers
Year:
1974

Citing 0
Cited 2

On a Novel Approach of Fault Detection in an Easily Testable Sequential Machine with Extra Inputs and Extra Outputs

IEEE Transactions on Computers
Generating Checking Sequences for Partial Reduced Finite State Machines

TestCom '08 / FATES '08 Proceedings of the 20th IFIP TC 6/WG 6.1 international conference on Testing of Software and Communicating Systems: 8th International Workshop

Quantified Score

Hi-index	14.98

Visualization

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.