Title :
State assignment of finite state machines using a genetic algorithm
Author :
Almaini, A.E.A. ; Miller, J.F. ; Thomson, P. ; Billina, S.
Author_Institution :
Dept. of Electr., Electron. & Comput. Eng., Napier Univ., Edinburgh, UK
fDate :
7/1/1995 12:00:00 AM
Abstract :
The use of genetic algorithms for the generation of optimal state assignments for synchronous finite state machines (FSM) is proposed. Results are presented to show that, in all examples attempted, the resulting state assignments are better than or at least as good as those produced by SPECTRAL, NOVA and MUSTANG and also closed partition assignments. On average, the genetic algorithm produced assignments with 33% less logic than the best produced by other algorithms
Keywords :
finite state machines; genetic algorithms; state assignment; closed partition assignments; finite state machines; genetic algorithm; state assignment; synchronous finite state machines;
Journal_Title :
Computers and Digital Techniques, IEE Proceedings -
DOI :
10.1049/ip-cdt:19951885
