Efficient checking sequences for testing finite state machines

Authors
Inan, K Ural, H
Citation
K. Inan et H. Ural, Efficient checking sequences for testing finite state machines, INF SOFTW T, 41(11-12), 1999, pp. 799-812
Citations number
26
Categorie Soggetti
Computer Science & Engineering
Journal title
INFORMATION AND SOFTWARE TECHNOLOGY
ISSN journal
09505849 → ACNP
Volume
41
Issue
11-12
Year of publication
1999
Pages
799 - 812
Database
ISI
SICI code
0950-5849(19990815)41:11-12<799:ECSFTF>2.0.ZU;2-V
Abstract
A general model for constructing minimal length checking sequences is propo sed. The model is based on the characteristics of checking sequences and se ts of state identification and verification sequences. Some existing method s are shown to be special cases of the proposed model. The minimality of th e resulting checking sequences is discussed and heuristic algorithms for th e construction of minimal length checking sequences given. (C) 1999 Elsevie r Science B.V. All rights reserved.