Computing Unique Input/Output Sequences Using Genetic Algorithms
The problem of computing Unique Input/Ouput sequences (UIOs) is NP-hard. Genetic algorithms (GAs) have been proven to be effective in providing good solutions for some NP-hard problems. In this work, we investigated the construction of UIOs using GAs. We defined a fitness function to guide the search of potential UIOs and introduce a DO NOT CARE character to improve the GA’s diversity. Experimental results suggest that, in a small system, the performance of the GA based approaches is no worse than that of random search while, in a more complex system, the GA based approaches outperform random search.
KeywordsFSMs UIOs Conformance Testing Genetic Algorithms Optimisation
Unable to display preview. Download preview PDF.
- 4.Sidhu, D.P., Leung, T.K.: Formal Methods for Protocol Testing: A Detailed Study. IEEE Transactions on Software Engineering 15(4) (April 1989)Google Scholar
- 8.Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)Google Scholar
- 9.Shen, Y.N., Lombardi, F., Dahbura, A.T.: Protocol Conformance Testing Using Multiple UIO Sequences. In: Proc. Ninth IFIP WG6.1 Int. Symp. on Protocol Specif., Test., and Verif. (1989)Google Scholar
- 11.Miller, R.E., Paul, S.: On the Generation of Minimal-Length Conformance Tests for Communication Protocols. IEEE/ACM Transactions on Networking 1(1) (February 1993)Google Scholar
- 12.Shen, X., Li, G.: A new protocol conformance test generation method and experimental results. In: Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing, Kansas City, Missouri, United States, pp. 75–84 (1992)Google Scholar