학술논문
On the complexity of generating optimal test sequences
Document Type
Periodical
Author
Source
IEEE Transactions on Software Engineering IIEEE Trans. Software Eng. Software Engineering, IEEE Transactions on. 17(9):976-978 Sep, 1991
Subject
Language
ISSN
0098-5589
1939-3520
2326-3881
1939-3520
2326-3881
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.ETX