State assignment of finite state machines using a genetic algorithm
State assignment of finite state machines using a genetic algorithm
复制标题
DOI：
10.1049/ip-cdt:19951885
复制
发表时间：
1995-07
期刊：
影响因子：
--
通讯作者：
A. Almaini;J. Miller;P. Thomson;S. Billina
中科院分区：
文献类型：
--
作者：
A. Almaini;J. Miller;P. Thomson;S. Billina
提出了利用遗传算法生成同步有限状态机（FSM）的最优状态分配。结果表明，在所尝试的所有示例中，所得到的状态分配优于或至少与SPECTRAL， NOVA和MUSTANG以及封闭分区分配产生的状态分配相同。平均而言，遗传算法生成的作业比其他算法生成的最佳作业逻辑少33%。
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.