Under certain well-defined conditions, determining the correctness of a system under test (SUT) is based on a checking sequence generated from a finite state machine (FSM) specification of the SUT. When there is a distinguishing sequence for the FSM, an efficient checking sequence may be produced from the elements of a set E_(α′) of α′-sequences that verify subsets of states and the elements of a set E_C of subsequences that test the individual transitions. An optimization algorithm may be used in order to produce a shortest checking sequence by connecting the elements of E_(α′) and E_C using transitions drawn from an acyclic set. Previous work did not consider whether some transition tests may be omitted from E_C. This paper investigates the problem of eliminating subsequences from E_C for those transitions that correspond to the last transitions traversed when a distinguishing sequence is applied in an α′-sequence to obtain a further reduction in the length of a checking sequence.
展开▼
