Collisions are helpful for computing unique input-output sequences

Authors:
Chao Qian;Yang Yu;Zhi-Hua Zhou
Affiliations:
Nanjing University, Nanjing, China;Nanjing University, Nanjing, China;Nanjing University, Nanjing, China
Venue:
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
Year:
2011

Citing 4
Cited 1

On the analysis of the (1+ 1) evolutionary algorithm

Theoretical Computer Science
Automated Unique Input Output Sequence Generation for Conformance Testing of FSMs

The Computer Journal
Crossover Can Be Constructive When Computing Unique Input Output Sequences

SEAL '08 Proceedings of the 7th International Conference on Simulated Evolution and Learning
Evolutionary algorithms - how to cope with plateaus of constantfitness and when to reject strings of the same fitness

IEEE Transactions on Evolutionary Computation

A study on the extended unique input/output sequence

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Computing unique input-output sequences (UIOs) from finite state machines (FSMs) is important for conformance testing in software engineering, where evolutionary algorithms (EAs) have been found helpful. Previously, by using a fitness function called W-fitness, (1+1)-EA was theoretically shown to be superior to random search on some FSM instances. Motivated by the observation that many plateaus exist in the fitness landscape of the W-fitness function, in this paper, we propose a new fitness function called C-fitness which is able to override the plateaus through exploiting collisions among the states of FSMs. We theoretically analyze the running time of (1+1)-EA on two problem classes. Our results show that the performance of (1+1)-EA using C-fitness is generally better and never worse than that using W-fitness in our studied cases, implying the importance of exploiting problem structures.