Computer Communications
A protocol test generation procedure
Computer Networks and ISDN Systems
Formal Methods for Protocol Testing: A Detailed Study
IEEE Transactions on Software Engineering
A new technique for generating protocol test
SIGCOMM '85 Proceedings of the ninth symposium on Data communications
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
Switching and Finite Automata Theory: Computer Science Series
Switching and Finite Automata Theory: Computer Science Series
Protocol Conformance Testing Using Multiple UIO Sequences
Proceedings of the IFIP WG6.1 Ninth International Symposium on Protocol Specification, Testing and Verification IX
Optimal length test sequence generation using distinguishing sequences
IEEE/ACM Transactions on Networking (TON)
On Minimizing the Lengths of Checking Sequences
IEEE Transactions on Computers
| Hi-index | 0.01 |
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.