Generalizing redundancy elimination in checking sequences

Abstract

Based on a distinguishing sequence for a Finite State Machine (FSM), an efficient checking sequence may be produced from the elements of a set E α′ of α′-sequences and a set ET of T-sequences, that both recognize the states, and elements of EC which represents the transitions in the FSM. An optimization algorithm may then be used to produce a reduced length checking sequence by connecting the elements of Eα′, ET, and EC using transitions taken from an acyclic set E″. It is known that only a subset E′C of EC is sufficient to form a checking sequence. This paper improves this result by reducing the number of elements in E′C that must be included in the generated checking sequence. © Springer-Verlag Berlin Heidelberg 2005.