Forward and backward simulations .2. Timing-based systems

被引:63
作者
Lynch, N [1 ]
Vaandrager, F [1 ]
机构
[1] CWI, NL-1090 GB AMSTERDAM, NETHERLANDS
基金
美国国家科学基金会;
关键词
D O I
10.1006/inco.1996.0060
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
A general automaton model for timing-based systems is presented and is used as the context for developing a variety of simulation proof techniques for such systems. These techniques include (1) refinements, (2) forward and backward simulations, (3) hybrid forward-backward and backward-forward simulations, and (4) history and prophecy relations. Relationships between the different types of simulations, as well as soundness and completeness results, are stated and proved. These results are (with one exception) analogous to the results for untimed systems in Part I of this paper. In fact, many of the results for the timed case are obtained as consequences of the analogous results for the untimed case. (C) 1996 academic Press. Inc.
引用
收藏
页码:1 / 25
页数:25
相关论文
共 64 条
  • [1] AN OLD-FASHIONED RECIPE FOR REAL-TIME
    ABADI, M
    LAMPORT, L
    [J]. ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1994, 16 (05): : 1543 - 1571
  • [2] THE EXISTENCE OF REFINEMENT MAPPINGS
    ABADI, M
    LAMPORT, L
    [J]. THEORETICAL COMPUTER SCIENCE, 1991, 82 (02) : 253 - 284
  • [3] AGGARWAL S, 1994, THESIS MIT ELECT ENG
  • [4] A THEORY OF TIMED AUTOMATA
    ALUR, R
    DILL, DL
    [J]. THEORETICAL COMPUTER SCIENCE, 1994, 126 (02) : 183 - 235
  • [5] THE ALGORITHMIC ANALYSIS OF HYBRID SYSTEMS
    ALUR, R
    COURCOUBETIS, C
    HALBWACHS, N
    HENZINGER, TA
    HO, PH
    NICOLLIN, X
    OLIVERO, A
    SIFAKIS, J
    YOVINE, S
    [J]. THEORETICAL COMPUTER SCIENCE, 1995, 138 (01) : 3 - 34
  • [6] ALUR R, 1993, P 14 ANN IEEE REAL T
  • [7] Alur R., 1991, THESIS STANFORD U
  • [8] Alur Rajeev, 1993, Hybrid Systems, P209, DOI [DOI 10.1007/3-540-57318-6, DOI 10.1007/3-540-57318-6_30]
  • [9] BAETEN JCM, 1990, LECT NOTES COMPUTER, V458
  • [10] BEATEN JCM, 1991, J FORMAL ASPECTS COM, V3, P142