In feature testing of communication protocols, we want to construct a minimal number of tests with a desirable fault coverage. We model the protocols by extended finite state machines and reduce the test generation process to optimization problems on graphs. We study efficient algorithms and their complexity. We report experimental results on real systems, including Personal HandyPhone System, a 5ESS based ISDN wireless system, and 5ESS Intelligent Network Application Protocol.
Index Terms:
protocols; optimization problems; feature testing; communication protocols; fault coverage; extended finite state machines; test generation process; graphs; efficient algorithms; algorithm complexity; experimental results; Personal HandyPhone System; 5ESS based ISDN wireless system; 5ESS Intelligent Network Application Protocol
Citation:
D. Lee, M. Yannakakis, "Optimization problems from feature testing of communication protocols," icnp, pp.66, Fourth International Conference on Network Protocols (ICNP'96), 1996