The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.09 - September (1991 vol.17)
pp: 976-978
ABSTRACT
<p>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.</p>
INDEX TERMS
protocol testing; communications protocols; maximal overlapping; test subsequences; polynomial time; FSM; finite state machine; optimal test sequence generation; OTSG problem; NP-complete; computational complexity; finite automata; program testing; protocols
CITATION
S.C. Boyd, H. Ural, "On the Complexity of Generating Optimal Test Sequences", IEEE Transactions on Software Engineering, vol.17, no. 9, pp. 976-978, September 1991, doi:10.1109/32.92918
19 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool