A HIERARCHY OF COMPOSITIONAL MODELS OF I/O-AUTOMATA

被引：0
|
作者：
JONSSON, B
机构：
[1] SWEDISH INST COMP SCI, STOCKHOLM, SWEDEN
[2] UNIV UPPSALA, DEPT COMP SYST, S-75105 UPPSALA, SWEDEN
来源：
LECTURE NOTES IN COMPUTER SCIENCE | 1990年 / 452卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：347 / 354
页数：8
相关论文
共 50 条
  • [1] I/O-automata based testing
    van der Bijl, M
    Peureux, F
    [J]. MODEL-BASED TESTING OF REACTIVE SYSTEMS, 2005, 3472 : 173 - 200
  • [2] Rethinking of I/O-automata composition
    Chabane, Sarah
    Ameur-Boulifa, Rabea
    Mezghiche, Mohamed
    [J]. 2017 FORUM ON SPECIFICATION AND DESIGN LANGUAGES (FDL), 2017,
  • [3] Assume-guarantee reasoning for hybrid I/O-automata by over-approximation of continuous interaction
    Frehse, G
    Han, Z
    Krogh, B
    [J]. 2004 43RD IEEE CONFERENCE ON DECISION AND CONTROL (CDC), VOLS 1-5, 2004, : 479 - 484
  • [4] Compositional analysis of expected delays in networks of probabilistic I/O automata
    Slark, EW
    Smolka, SA
    [J]. THIRTEENTH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 1998, : 466 - 477
  • [5] Compositional Liveness-Preserving Conformance Testing of Timed I/O Automata
    Luthmann, Lars
    Goettmann, Hendrik
    Lochau, Malte
    [J]. FORMAL ASPECTS OF COMPONENT SOFTWARE, FACS 2019, 2020, 12018 : 147 - 169
  • [6] Learning I/O Automata
    Aarts, Fides
    Vaandrager, Frits
    [J]. CONCUR 2010 - CONCURRENCY THEORY, 2010, 6269 : 71 - 85
  • [7] Hybrid I/O automata
    Lynch, N
    Segala, R
    Vaandrager, F
    [J]. INFORMATION AND COMPUTATION, 2003, 185 (01) : 105 - 157
  • [8] TOWARDS A COMPLETE HIERARCHY OF COMPOSITIONAL DATA-FLOW MODELS
    JONSSON, B
    KOK, JN
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1991, 526 : 204 - 225
  • [9] GAMES I/O AUTOMATA PLAY
    REINGOLD, N
    WANG, DW
    ZUCK, LD
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1992, 630 : 325 - 339
  • [10] A note on fairness in I/O automata
    Romijn, J
    Vaandrager, F
    [J]. INFORMATION PROCESSING LETTERS, 1996, 59 (05) : 245 - 250
12345