DocumentCode
1502592
Title
On the complexity of generating optimal test sequences
Author
Boyd, Sylvia C. ; Ural, Hasan
Author_Institution
Dept. of Comput. Sci., Ottawa Univ., Ont., Canada
Volume
17
Issue
9
fYear
1991
fDate
9/1/1991 12:00:00 AM
Firstpage
976
Lastpage
978
Abstract
The authors investigate whether maximal overlapping of protocol test subsequences can be achieved in polynomial time. They review the concepts related to FSM (finite state machine)-based test sequence generation and then define the optimal test sequence generation (OTSG) problem. It is proved that the OTSG problem is NP-complete. Therefore an efficient solution to the problem should not be expected in the general case
Keywords
computational complexity; finite automata; program testing; protocols; FSM; NP-complete; OTSG problem; communications protocols; finite state machine; maximal overlapping; optimal test sequence generation; polynomial time; protocol testing; test subsequences; Computer science; Councils; Polynomials; Protocols; Tail; Testing;
fLanguage
English
Journal_Title
Software Engineering, IEEE Transactions on
Publisher
ieee
ISSN
0098-5589
Type
jour
DOI
10.1109/32.92918
Filename
92918
Link To Document