Ant Colony Optimisation for Generation of Conformance Testing Sequences using a Characterising Set

Document Type

Conference Proceeding


ACTA Press


Computing, Health and Science


Computer and Security Science




This article was originally published as: Lam, C. P., Xiao, J., & Li, H. (2007). Ant colony optimisation for generation of conformance testing sequences using a characterising set. Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology. ACST'07. (pp. 140-146). Anaheim, California: ACTA Press. Original article available here


Protocol conformance testing generally involves cheching whether the protocol under test conforms to the given specification. The generation of test sequences in an efficient and effective way that achieves the required fault detection coverage is highly desirable. This paper proposed an approach that formulates the problem of finding shorter test sequences based on the Wp method into one of finding the shortest tour in the asymmetric travelling salesman problem (ATSP). In the formulation of the ATSP, the approach excludes redundant test segments, employs the concepts of overlap to reduce test sequence length and concatenation without linking cost ito the test sequence generation technique. The approach recast a Software Engineering problem as a search-based problems using Ant Colony Optimization to find the shortest will maintain the same fault detection capability as those of the Wp method. The approach is applicable to every minimal FSM as each one of them possesses a characterising set.