International Symposium on Computer and Information Sciences

ISCIS 2005: Computer and Information Sciences - ISCIS 2005 pp 915-926

Generalizing Redundancy Elimination in Checking Sequences

  • K. Tuncay Tekle
  • Hasan Ural
  • M. Cihan Yalcin
  • Husnu Yenigun
Conference paper

DOI: 10.1007/11569596_93

Volume 3733 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Tekle K.T., Ural H., Yalcin M.C., Yenigun H. (2005) Generalizing Redundancy Elimination in Checking Sequences. In: Yolum ., Güngör T., Gürgen F., Özturan C. (eds) Computer and Information Sciences - ISCIS 2005. ISCIS 2005. Lecture Notes in Computer Science, vol 3733. Springer, Berlin, Heidelberg

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 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_{\alpha^{\prime}}\), 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • K. Tuncay Tekle
    • 1
  • Hasan Ural
    • 2
  • M. Cihan Yalcin
    • 1
  • Husnu Yenigun
    • 1
  1. 1.Faculty of Engineering and Natural SciencesSabanci UniversityTuzla, IstanbulTurkey
  2. 2.School of Information Technology and EngineeringUniversity of OttawaOttawaCanada