Supervisory control of finite state machines

被引：0
作者：
Aziz, A
Balarin, F
Brayton, RK
DiBenedetto, MD
Saldanha, A
机构：
[1] CADENCE BERKELEY LABS,BERKELEY,CA
[2] UNIV ROMA LA SAPIENZA,DIPARTIMENTO INFORMAT & SISTEMIST,ROME,ITALY
来源：
COMPUTER AIDED VERIFICATION | 1995年 / 939卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We address a problem of finding a finite state machine (FSM), which composed with a given FSM, satisfies a given specification. The composition we use is the standard synchronous automata composition restricted to cases which correctly model hardware interconnection. For the satisfaction relation, we use language containment. We present a procedure that will generate a solution (if one exists) which is maximal, i.e. contains behaviors of all other solutions.
引用
收藏
页码：279 / 292
页数：14
相关论文
共 18 条
  • [1] AZIZ A, 1994, M9496 UCBERL U CAL C
  • [2] SUPERVISORY CONTROL OF A RAPID THERMAL MULTIPROCESSOR
    BALEMI, S
    HOFFMANN, GJ
    GYUGYI, P
    WONGTOI, H
    FRANKLIN, GF
    [J]. IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1993, 38 (07) : 1040 - 1059
  • [3] SOLVING SEQUENTIAL CONDITIONS BY FINITE-STATE STRATEGIES
    BUCHI, JR
    LANDWEBER, LH
    [J]. TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1969, 138 (APR) : 295 - +
  • [4] BURCH JR, 1993, 1993 IEEE/ACM INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN - DIGEST OF TECHNICAL PAPERS, P612, DOI 10.1109/ICCAD.1993.580149
  • [5] DIBENEDETTO MD, 1994, P IEEE C DEC CONTR D
  • [6] DIBENEDETTO MD, 1995, P EU CONTR C SEPT
  • [7] GOLASZEWSKI CH, 1990, LNCS, V531, P282
  • [8] Hopcroft J. E., 1979, INTRO AUTOMATA THEOR
  • [9] JENSEN OH, 1993, LECT NOTES COMPUTER, V715
  • [10] JONSSON B, 1991, LECT NOTES COMPUTER, V493
12