## Lower bounds on lengths of checking sequencesJourdan, Guy-Vincent and Ural, Hasan and Yenigün, Hüsnü and Zhang, Ji Chao (2010)
Full text not available from this repository. Official URL: http://dx.doi.org/10.1007/s00165-009-0135-6 ## AbstractLower 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.
## Available Versions of this Item- Lower bounds on lengths of checking sequences. (deposited 19 Nov 2009 16:29)
- Lower bounds on lengths of checking sequences. (deposited 08 Nov 2010 10:34)
**[Currently Displayed]**
- Lower bounds on lengths of checking sequences. (deposited 08 Nov 2010 10:34)
Repository Staff Only: item control page |