A FORMAL THEORY OF SIMULATIONS BETWEEN INFINITE AUTOMATA

被引:0
|
作者
LOEWENSTEIN, P [1 ]
机构
[1] SUN MICROSYST INC,MT VIEW,CA
来源
IFIP TRANSACTIONS A-COMPUTER SCIENCE AND TECHNOLOGY | 1993年 / 20卷
关键词
MODELS OF COMPUTATION; DEDUCTION AND THEOREM PROVING;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Automata are suitable for modelling a wide range of sequential and concurrent hardware. They can be used at many levels of abstraction, from top-level specifications to register transfer descriptions suitable for input to synthesis tools. This paper covers approaches for relating one automaton with another using simulations and tranformations on automata. The entire theory is mechanically derived in, and intended for use in a higher-order logic theorem prover. Because automaton-based models can be used at multiple abstraction levels, much of the formal verification of sequential and concurrent designs can be performed by composing and relating automata.
引用
收藏
页码:227 / 246
页数:20
相关论文
共 50 条
  • [1] Formal theory of simulations between infinite automata
    Loewenstein, Paul, 1600, (03): : 1 - 2
  • [2] A FORMAL THEORY OF SIMULATIONS BETWEEN INFINITE AUTOMATA
    LOEWENSTEIN, P
    FORMAL METHODS IN SYSTEM DESIGN, 1993, 3 (1-2) : 117 - 149
  • [3] FORMAL LANGUAGE AND AUTOMATA THEORY
    KOBAYASHI, K
    NISHIO, H
    NOZAKI, A
    TAKAHASHI, M
    JAPAN ANNUAL REVIEWS IN ELECTRONICS COMPUTERS & TELECOMMUNICATIONS, 1983, 7 : 31 - 49
  • [4] FORMAL LANGUAGE AND AUTOMATA THEORY.
    Kobayashi, Kojiro
    Nishio, Hidenosuke
    Nozaki, Akihiro
    Takahashi, Masako
    Japan Annual Reviews in Electronics, Computers & Telecommunications, 1983, 7 : 31 - 49
  • [5] A bialgebraic approach to automata and formal language theory
    Worthington, James
    ANNALS OF PURE AND APPLIED LOGIC, 2012, 163 (07) : 745 - 762
  • [6] A Second Course in Formal Languages and Automata Theory
    Koubek, Vaclav
    COMPUTER SCIENCE REVIEW, 2009, 3 (03) : 193 - 194
  • [7] A Bialgebraic Approach to Automata and Formal Language Theory
    Worthington, James
    LOGICAL FOUNDATIONS OF COMPUTER SCIENCE, 2009, 5407 : 451 - 467
  • [8] Optimal simulations between unary automata
    Mereghetti, C
    Pighizzini, G
    SIAM JOURNAL ON COMPUTING, 2001, 30 (06) : 1976 - 1992
  • [9] Optimal simulations between unary automata
    Mereghetti, C
    Pighizzini, G
    STACS 98 - 15TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 1998, 1373 : 139 - 149
  • [10] Simulations between programs as cellular automata
    Blair, HA
    Dushin, F
    Humenn, P
    LOGIC PROGRAMMING AND NONMONOTONIC REASONING, 1997, 1265 : 115 - 131