Evolutionary algorithm for state assignment of finite state machines

Proceedings Euromicro Symposium on Digital System Design. Architectures, Methods and Tools Pub Date : 2002-09-04 DOI:10.1109/DSD.2002.1115392

Mariusz Chyzy, W. Kosinski

引用次数: 16

Abstract

The paper proposes an evolutionary algorithm (EA) for the state assignment problem (SAP). Two original crossover operators are presented. They are experimentally compared with other known crossovers for SAP using a set of benchmark finite state machines. Solutions generated by EA (using different crossover operators) are compared with the random ones and with the state assignments generated by the MAX+PLUS II system. Experimental results show that the solutions found by EA are significantly better (up to 55%) than those from MAX+PLUS II. Moreover, EA equipped with proposed crossover operators found better results than those obtained with the use of other compared crossovers.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

有限状态机状态分配的进化算法

提出了一种状态分配问题的进化算法(EA)。提出了两种原始的交叉算子。使用一组基准有限状态机，将它们与其他已知的SAP交叉进行实验比较。将EA生成的解(使用不同的交叉算子)与随机解以及MAX+PLUS II系统生成的状态分配进行了比较。实验结果表明，EA找到的解明显优于MAX+PLUS II的解(高达55%)。此外，配备所提出的交叉算子的EA比使用其他比较交叉算子获得更好的结果。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

Proceedings Euromicro Symposium on Digital System Design. Architectures, Methods and Tools

自引率

0.00%

发文量

期刊最新文献

Fault latencies of concurrent checking FSMs On the fundamental design gap in terabit per second packet switching Bit-level allocation of multiple-precision specifications Improving mW/MHz ratio in FPGAs pipelined designs Hardware implementation of a memory allocator