Using Distinguishing and UIO Sequences Together in a Checking Sequence

  • M. Cihan Yalcin
  • Husnu Yenigun
Conference paper

DOI: 10.1007/11754008_17

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3964)
Cite this paper as:
Yalcin M.C., Yenigun H. (2006) Using Distinguishing and UIO Sequences Together in a Checking Sequence. In: Uyar M.Ü., Duale A.Y., Fecko M.A. (eds) Testing of Communicating Systems. TestCom 2006. Lecture Notes in Computer Science, vol 3964. Springer, Berlin, Heidelberg


If a finite state machine M does not have a distinguishing sequence, but has UIO sequences for its states, there are methods to produce a checking sequence for M. However, if M has a distinguishing sequence \(\bar{D}\) , then there are methods that make use of \(\bar{D}\) to construct checking sequences that are much shorter than the ones that would be constructed by using only the UIO sequences for M. The methods to applied when a distinguishing sequence exists, only make use of the distinguishing sequences. In this paper we show that, even if M has a distinguishing sequence \(\bar{D}\), the UIO sequences can still be used together with \(\bar{D}\) to construct shorter checking sequences.

Download to read the full conference paper text

Copyright information

© IFIP International Federation for Information Processing 2006

Authors and Affiliations

  • M. Cihan Yalcin
    • 1
  • Husnu Yenigun
    • 1
  1. 1.Faculty of Engineering and Natural SciencesSabanci UniversityTuzla, IstanbulTurkey

Personalised recommendations