论文信息 - Comparison of Crossover Operations for the State Assignment Problem

Comparison of Crossover Operations for the State Assignment Problem

The paper presents a brief overview of crossover operators, along with the genotypes, applicable to the state assignment problem (SAP). Comparative experimental studies of genetic algorithms with different crossover operators applied to the SAP are described and their results are discussed.

Witold Kosinski | Mariusz Chyzy | W. Kosinski | Mariusz Chyzy

[1] Tiziano Villa,et al. Synthesis of Finite State Machines: Logic Optimization , 1997 .

[2] Lawrence. Davis,et al. Handbook Of Genetic Algorithms , 1990 .

[3] Witold Kosiński,et al. Genetic algorithm for the state assignment problem , 2001 .

[4] Santanu Chattopadhyay,et al. Genetic algorithm based approach for integrated state assignment and flipflop selection in finite state machine synthesis , 1998, Proceedings Eleventh International Conference on VLSI Design.

[5] Zbigniew Michalewicz,et al. Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[6] A. E. A. Almaini,et al. State assignment of finite state machines using a genetic algorithm , 1995 .

[7] G. Syswerda,et al. Schedule Optimization Using Genetic Algorithms , 1991 .

[8] José Nelson Amaral,et al. Designing genetic algorithms for the state assignment problem , 1995, IEEE Trans. Syst. Man Cybern..