Generalizing Redundancy Elimination in Checking Sequences

* Final gross prices may vary according to local VAT.

Get Access

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_{\alpha^{\prime}}\) of α –sequences and a set E T of T–sequences, that both recognize the states, and elements of E C 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_{\alpha^{\prime}}\), E T , and E C using transitions taken from an acyclic set E ′′. It is known that only a subset E C of E C 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.