Jourdan, Guy-Vincent and Ural, Hasan and Yenigün, Hüsnü and Zhang, Ji Chao (2010) Lower bounds on lengths of checking sequences. Formal Aspects of Computing, 22 (6). pp. 667-679. ISSN 0934-5043 (Print) 1433-299X (Online)
This is the latest version of this item.
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 |
| Divisions: | Faculty of Engineering and Natural Sciences > Academic programs > Computer Science & Eng. Faculty of Engineering and Natural Sciences |
| Depositing User: | Hüsnü Yenigün |
| Date Deposited: | 08 Nov 2010 10:34 |
| Last Modified: | 29 Jul 2019 10:51 |
| URI: | https://research.sabanciuniv.edu/id/eprint/15071 |
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]
Actions (login required)
- View Item