Evolutionary algorithm for state assignment of finite state machines

被引：9
|
作者：
Chyzy, M [1 ]
Kosinski, W [1 ]
机构：
[1] Polish Japanese Inst Informat Technol, PL-02008 Warsaw, Poland
来源：
EUROMICRO SYMPOSIUM ON DIGITAL SYSTEM DESIGN, PROCEEDINGS: ARCHITECTURES, METHODS AND TOOLS | 2002年
关键词：
D O I：
10.1109/DSD.2002.1115392
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
The paper proposes evolutionary algorithm (EA) for 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 MAX+PLUS II system. Experimental results show that 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.
引用
收藏
页码：359 / 362
页数：4
相关论文
共 50 条
  • [11] Low Power Synthesis of Finite State Machines - State Assignment Decomposition Algorithm
    Kajstura, Krzysztof
    Kania, Dariusz
    JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS, 2018, 27 (03)
  • [12] Twofold State Assignment for the Moore Finite State Machines
    Barkalov, A. A.
    Titarenko, L. A.
    Baev, A. V.
    Matviienko, A. V.
    CYBERNETICS AND SYSTEMS ANALYSIS, 2023, 59 (01) : 27 - 38
  • [13] State assignment and logic optimization for finite state machines
    Czerwinski, Robert
    Kania, Dariusz
    IFAC WORKSHOP ON PROGRAMMABLE DEVICES AND EMBEDDED SYSTEMS (PDES 2009), PROCEEDINGS, 2009, : 39 - 44
  • [14] Twofold State Assignment for the Moore Finite State Machines
    A. A. Barkalov
    L. A. Titarenko
    A. V. Baev
    A. V. Matviienko
    Cybernetics and Systems Analysis, 2023, 59 : 27 - 38
  • [15] State assignment of finite state machines for low power applications
    Natl Chung-Hsing Univ, Taichung, Taiwan
    Electron Lett, 25 (2323-2324):
  • [16] State assignment for detecting erroneous transitions in finite state machines
    Damm, Markus
    DSD 2006: 9TH EUROMICRO CONFERENCE ON DIGITAL SYSTEM DESIGN: ARCHITECTURES, METHODS AND TOOLS, PROCEEDINGS, 2006, : 483 - 490
  • [17] Improved state assignment for burst mode finite state machines
    Rutten, JWJM
    Berkelaar, MRCM
    THIRD INTERNATIONAL SYMPOSIUM ON ADVANCED RESEARCH IN ASYNCHRONOUS CIRCUITS AND SYSTEMS, PROCEEDINGS, 1997, : 228 - 239
  • [18] State assignment of finite state machines for low power applications
    Wang, SJ
    Horng, MD
    ELECTRONICS LETTERS, 1996, 32 (25) : 2323 - 2324
  • [19] Low-power state assignment for asynchronous finite state machines
    Shieh, MD
    Ju, WS
    Sheu, MH
    PROCEEDINGS OF THE 39TH MIDWEST SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS I-III, 1996, : 1325 - 1328
  • [20] Low-power state assignment for asynchronous finite state machines
    Natl Yunlin Inst of Technology, Yunlin, Taiwan
    Midwest Symp Circuits Syst, (1325-1328):
12345