Sciweavers

Share
ISCIS
2005
Springer

Generalizing Redundancy Elimination in Checking Sequences

10 years 5 months ago
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 EC of EC is sufficient to form a checking sequence. This paper improves this result by reducing the number of elements in EC that must be included in the generated checking sequence.
K. Tuncay Tekle, Hasan Ural, M. Cihan Yalcin, H&uu
Added 27 Jun 2010
Updated 27 Jun 2010
Type Conference
Year 2005
Where ISCIS
Authors K. Tuncay Tekle, Hasan Ural, M. Cihan Yalcin, Hüsnü Yenigün
Comments (0)
books