Research on Counterexample Search Based on Simulated Annealing Genetic Algorithm

The technology of searching for system failure through counterexample in model checking has drawn some attentions recently. For large concurrent systems, the number of states is always in an exponential growth when the number of processes which composed the system increases. It is so ineffective to use common heuristic method to search for the counterexample, that researching how to search for the counterexample in model checking for concurrent systems effectively becomes an important research domain. For the problem of searching for counterexample, a new annealing genetic algorithm was put forward in this paper. Compared with the genetic algorithm, this algorithm can promote the efficiency to a certain extent.