Issue No. 09 - September (1991 vol. 17)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/32.92918
<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>
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
H. Ural and S. Boyd, "On the Complexity of Generating Optimal Test Sequences," in IEEE Transactions on Software Engineering, vol. 17, no. , pp. 976-978, 1991.