Lower bounds on lengths of checking sequences
- First Online:
- 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
- 79 Downloads
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.