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 条
  • [31] Symbolic forward/backward traversals of large finite state machines
    Cabodi, G
    Camurati, P
    Quer, S
    JOURNAL OF SYSTEMS ARCHITECTURE, 2000, 46 (12) : 1137 - 1158
  • [32] ESTIMATORS FOR LOGIC MINIMIZATION AND IMPLEMENTATION SELECTION OF FINITE STATE MACHINES
    TENBERG, AJWM
    MICROPROCESSING AND MICROPROGRAMMING, 1992, 35 (1-5): : 151 - 158
  • [33] Test suite minimization for embedded nondeterministic finite state machines
    Yevtushenko, N
    Cavalli, A
    Anido, R
    TESTING OF COMMUNICATING SYSTEMS: METHODS AND APPLICATIONS, 1999, 21 : 237 - 250
  • [34] Minimization Method of Finite State Machines for Low Power Design
    Klimowicz, Adam
    Solov'ev, Valery
    Grzes, Tomasz
    2015 EUROMICRO CONFERENCE ON DIGITAL SYSTEM DESIGN (DSD), 2015, : 259 - 262
  • [35] Interface finite-state machines: Definition, minimization, and decomposition
    Daga, AJ
    Birmingham, WP
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1997, 16 (05) : 497 - 505
  • [36] Multiple Mutation Testing from Finite State Machines with Symbolic Inputs
    Timo, Omer Nguena
    Petrenko, Alexandre
    Ramesh, S.
    TESTING SOFTWARE AND SYSTEMS (ICTSS 2017), 2017, 10533 : 108 - 125
  • [37] Toward testing from finite state machines with symbolic inputs and outputs
    Petrenko, Alexandre
    SOFTWARE AND SYSTEMS MODELING, 2019, 18 (02): : 825 - 835
  • [38] Towards Testing from Finite State Machines with Symbolic Inputs and Outputs
    Petrenko, Alexandre
    21ST ACM/IEEE INTERNATIONAL CONFERENCE ON MODEL DRIVEN ENGINEERING LANGUAGES AND SYSTEMS (MODELS 2018), 2018, : 187 - 187
  • [39] Toward testing from finite state machines with symbolic inputs and outputs
    Alexandre Petrenko
    Software & Systems Modeling, 2019, 18 : 825 - 835
  • [40] MULTILEVEL SYNTHESIS OF FINITE STATE MACHINES BASED ON SYMBOLIC FUNCTIONAL DECOMPOSITION
    Rawski, Mariusz
    Selvaraj, Henry
    Luba, Tadeusz
    Szotkowski, Piotr
    INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE AND APPLICATIONS, 2006, 6 (02) : 257 - 271
12345