Formal Aspects of Computing

, Volume 22, Issue 6, pp 667–679

Lower bounds on lengths of checking sequences

  • Guy-Vincent Jourdan
  • Hasan Ural
  • Hüsnü Yenigün
  • Ji Chao Zhang
Original Article

DOI: 10.1007/s00165-009-0135-6

Cite this article as:
Jourdan, GV., Ural, H., Yenigün, H. et al. Form Asp Comp (2010) 22: 667. doi:10.1007/s00165-009-0135-6

Abstract

Lower bounds on the lengths of checking sequences constructed for testing from Finite State Machine-based specifications are established. These bounds consider the case where a distinguishing sequence is used in forming state recognition and transition verification subsequences and identify the effects of overlapping among such subsequences. Empirical results show that the existing methods for construction of checking sequences provide checking sequences with lengths that are within acceptable distance to these lower bounds.

Keywords

TestingModel-based testingFinite state machinesFault detectionChecking sequence constructionDistinguishing sequences

Copyright information

© British Computer Society 2009

Authors and Affiliations

  • Guy-Vincent Jourdan
    • 1
  • Hasan Ural
    • 1
  • Hüsnü Yenigün
    • 2
  • Ji Chao Zhang
    • 1
  1. 1.SITE, University of OttawaOttawaCanada
  2. 2.FENS, Sabanci UniversityIstanbulTurkey