Lower bounds on lengths of checking sequences

Jourdan, Guy-Vincent and Ural, Hasan and Yenigün, Hüsnü and Zhang, Ji Chao (2009) Lower bounds on lengths of checking sequences. (Accepted/In Press)

There is a more recent version of this item available.

Full text not available from this repository.

Official URL: http://dx.doi.org/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.

Item Type:	Article
Uncontrolled Keywords:	Testing, model-based testing, finite state machines, fault detection, checking sequence construction, distinguishing sequences
Subjects:	Q Science > QA Mathematics > QA075 Electronic computers. Computer science
ID Code:	12813
Deposited By:	Hüsnü Yenigün
Deposited On:	19 Nov 2009 16:29
Last Modified:	08 Nov 2010 10:34

Available Versions of this Item

Lower bounds on lengths of checking sequences. (deposited 19 Nov 2009 16:29) [Currently Displayed]
- Lower bounds on lengths of checking sequences. (deposited 08 Nov 2010 10:34)

Repository Staff Only: item control page