Lower bounds for the length of test sequences using UIOs
Marion Rodrigues, Hasan Ural · Networks · 1995
Abstract The optimality of the length of a test sequence for a given finite‐state machine can be determined only with respect to the class of test sequences that employ the same number and type of state identification/verification (SIV) sequences and satisfy the same requirements for the starting and terminating states. Given a certain number and type of SIV sequences, we identify three different types of optimality for test sequences: Type11 requires test sequences to begin and end at the initial state; Type1y requires only that test sequences begin at the initial state; and Typexy imposes no requirements whatsoever on the starting and terminating states. Based on these definitions, we investigate the case where Unique Input Output (UIO) sequences are given as SIV sequences and derive lower bounds for the length of test sequences of Type11, Type1y, and Typexy.