SYMBOLIC COVER MINIMIZATION OF FULLY I/O SPECIFIED FINITE STATE MACHINES

被引：1
|
作者：
DRUSINSKYYORESH, D
机构：
[1] CAD Department, Sony Corporation, Atsugi-shi, Kanagawa-ken
来源：
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS | 1990年 / 9卷 / 07期
关键词：
D O I：
10.1109/43.55214
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
Symbolic cover minimization is an important step within a well-known state-assignment technique for finite state machines (FSM's) [2]. Currently, multiple-valued-input logic minimization techniques are used to find a minimum symbolic cover. The former problem, however, is computationally intractable, so heuristics are used. We show a simplified technique, based on an extension of the FSM minimization technique, which enables an efficient deterministic solution for fully I/O specified FSM's. © 1990 IEEE
引用
收藏
页码：779 / 781
页数：3
相关论文
共 50 条
  • [21] A new algorithm for the reduction of incompletely specified finite state machines
    Pena, JM
    Oliveira, AL
    1998 IEEE/ACM INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN: DIGEST OF TECHNICAL PAPERS, 1998, : 482 - 489
  • [22] Decomposition of finite state machines for area, delay minimization
    Shelar, Rupesh S.
    Desai, Madhav P.
    Narayanan, H.
    Proceedings - IEEE International Conference on Computer Design: VLSI in Computers and Processors, 1999, : 620 - 625
  • [23] Minimization of mealy finite state machines via internal state merging
    Solov'ev, V. V.
    JOURNAL OF COMMUNICATIONS TECHNOLOGY AND ELECTRONICS, 2011, 56 (02) : 207 - 213
  • [24] Minimization of mealy finite state machines via internal state merging
    V. V. Solov’ev
    Journal of Communications Technology and Electronics, 2011, 56 : 207 - 213
  • [25] On Using Speed as the Criteria of State Selection for Minimization of Finite State Machines
    Klimowicz, Adam
    COMPUTER INFORMATION SYSTEMS AND INDUSTRIAL MANAGEMENT, CISIM 2016, 2016, 9842 : 493 - 503
  • [26] Vector Symbolic Finite State Machines in Attractor Neural Networks
    Cotteret, Madison
    Greatorex, Hugh
    Ziegler, Martin
    Chicca, Elisabetta
    NEURAL COMPUTATION, 2024, 36 (04) : 549 - 595
  • [27] Checking Experiments for Symbolic Input/Output Finite State Machines
    Petrenko, Alexandre
    2016 IEEE NINTH INTERNATIONAL CONFERENCE ON SOFTWARE TESTING, VERIFICATION AND VALIDATION WORKSHOPS (ICSTW), 2016, : 229 - 237
  • [28] Generating Minimum Height ADSs for Partially Specified Finite State Machines
    Hierons, Robert M.
    Turker, Uraz Cengiz
    INFORMATION SCIENCES AND SYSTEMS 2015, 2016, 363 : 171 - 179
  • [29] Decomposed symbolic forward traversals of large finite state machines
    Quer, S
    Cabodi, G
    Camurati, P
    EURO-DAC '96 - EUROPEAN DESIGN AUTOMATION CONFERENCE WITH EURO-VHDL '96 AND EXHIBITION, PROCEEDINGS, 1996, : 170 - 175
  • [30] Symbolic forward/backward traversals of large finite state machines
    Cabodi, G
    Camurati, P
    Quer, S
    JOURNAL OF SYSTEMS ARCHITECTURE, 2000, 46 (12) : 1137 - 1158
12345