Algorithms to Reach a Certain State in a Non-Deterministi c FSM
Carlos Molinero, Manuel NUfiez, Robert M. Hierons · 2011
Finite State Machine. Our approach proposes the creation of an adaptive sequence, which is a tree of input and outputs that contains the possible behaviors of the non-deterministi c Finite State Machine, through a Genetic Algorithm. Essentially, we will characterize the DNA of the individuals as an adaptive sequence and allow the population to evolve until a solution is found. To assure the validity of our approach, we compare it with other methodologies such as hiIlclimbing and random. We show that the Genetic Algorithm obtains a higher rate of success in creating the adaptive sequences.