Title :
Reduced length checking sequences
Author :
Hierons, Robert M. ; Ural, Hasan
Author_Institution :
Dept. of Inf. Syst. & Comput., Brunel Univ., Uxbridge, UK
fDate :
9/1/2002 12:00:00 AM
Abstract :
Here, the method proposed by Ural, Wu and Zhang (1997) for constructing minimal-length checking sequences based on distinguishing sequences is improved. The improvement is based on optimizations of the state recognition sequences and their use in constructing test segments. It is shown that the proposed improvement further reduces the length of checking sequences produced from minimal, completely specified, and deterministic finite state machines.
Keywords :
deterministic automata; finite state machines; logic testing; completely specified finite state machines; deterministic finite state machines; distinguishing sequences; minimal finite state machines; minimal-length checking sequences; optimizations; state recognition sequences; test segments; Automata; Circuit testing; Communication system control; Control system synthesis; Learning systems; Minimization; Pattern matching; Protocols; Sequential analysis; System testing;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.2002.1032630
