Reformulation of the Generation of Conformance Testing Sequences to the Asymmetric Travelling Salesman Problem

Document Type

Conference Proceeding


ACM Press


Computing, Health and Science


Computer and Security Science




This article was originally published as: Xiao, J., Lam, C. P., Li, H., & Wang, J. (2006). Reformulation of the generation of conformance testing sequences to the asymmetric travelling salesman problem. Proceedings of the 8th annual conference on Genetic and Evolutionary Computation. GECCO '06. (pp. 1933-1940). New York, New York: ACM Press. Original article available here


Protocol conformance testing generally involves checking whether the protocol under test conforms to the given specification. An important issue in protocol conformance testing is the generation of test sequences in an efficient and effective way that achieves the required fault detection coverage. This paper proposed an approach for finding the shorter test sequences for protocol conformance testing based on the Wp method. The approach provides a technique for transforming the problem of the test sequence generation from a given FSM into one of finding the shortest path in the asymmetric travelling salesman problem by using one of the many existing meta-heuristic algorithms for addressing TSP. The approach addresses the issue of reformulation of Software Engineering problems as search-based problems in Search-based Software Engineering. The paper also shows that the resulting test sequences will maintain the same fault detection capability as those of the Wp method.




Link to publisher version (DOI)