Reactive modules

被引:293
作者
Alur, R
Henzinger, TA
机构
[1] Univ Penn, Philadelphia, PA 19104 USA
[2] AT&T Bell Labs, Dept Informat & Comp Sci, Philadelphia, PA 19104 USA
[3] Univ Calif Berkeley, Dept Elect Engn & Comp Sci, Berkeley, CA 94720 USA
基金
美国国家科学基金会;
关键词
modeling of reactive systems; formal verification; compositionality; concurrency modeling; synchrony and asynchrony; assume-guarantee reasoning; temporal abstraction;
D O I
10.1023/A:1008739929481
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We present a formal model for concurrent systems. The model represents synchronous and asynchronous components in a uniform framework that supports compositional (assume-guarantee) and hierarchical (stepwise-refinement) design and verification. While synchronous models are based on a notion of atomic computation step, and asynchronous models remove that notion by introducing stuttering, our model is based on a flexible notion of what constitutes a computation step: by applying an abstraction operator to a system, arbitrarily many consecutive steps can be collapsed into a single step. The abstraction operator, which may turn an asynchronous system into a synchronous one, allows us to describe systems at various levels of temporal detail. For describing systems at various levels of spatial detail, we use a hiding operator that may turn a synchronous system into an asynchronous one. We illustrate the model with diverse examples from synchronous circuits, asynchronous shared-memory programs, and synchronous message-passing protocols.
引用
收藏
页码:7 / 48
页数:42
相关论文
共 26 条
  • [1] THE EXISTENCE OF REFINEMENT MAPPINGS
    ABADI, M
    LAMPORT, L
    [J]. THEORETICAL COMPUTER SCIENCE, 1991, 82 (02) : 253 - 284
  • [2] CONJOINING SPECIFICATIONS
    ABADI, M
    LAMPORT, L
    [J]. ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1995, 17 (03): : 507 - 534
  • [3] SAFETY WITHOUT STUTTERING
    ALPERN, B
    DEMERS, AJ
    SCHNEIDER, FB
    [J]. INFORMATION PROCESSING LETTERS, 1986, 23 (04) : 177 - 180
  • [4] Alur R, 1995, LECT NOTES COMPUT SC, V939, P166
  • [5] Alur R, 1998, LECT NOTES COMPUT SC, V1384, P330, DOI 10.1007/BFb0054181
  • [6] Alur R, 1998, LECT NOTES COMPUT SC, V1427, P521, DOI 10.1007/BFb0028774
  • [7] [Anonymous], 1996, LECT NOTES COMPUTER
  • [8] SYNCHRONOUS PROGRAMMING WITH EVENTS AND RELATIONS - THE SIGNAL LANGUAGE AND ITS SEMANTICS
    BENVENISTE, A
    LEGUERNIC, P
    JACQUEMOT, C
    [J]. SCIENCE OF COMPUTER PROGRAMMING, 1991, 16 (02) : 103 - 149
  • [9] Berry G., 1988, 842 INRIA
  • [10] BERRY G, 1993, POPL 93, P85