Composition and refinement of discrete real-time systems

被引:19
作者
Ostroff, JS [1 ]
机构
[1] York Univ, Dept Comp Sci, N York, ON M3J 1P3, Canada
关键词
design; verification; abstraction; model-checking; modules; refinement; state explosion; temporal logic; timed logic;
D O I
10.1145/295558.295560
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Reactive systems exhibit ongoing, possibly nonterminating, interaction with the environment. Real-time systems are reactive systems that must satisfy quantitative timing constraints. This paper presents a structured compositional design method for discrete real-time systems that can be used to combat the combinatorial explosion of states in the verification of large systems. A composition rule describes how the correctness of the system can be determined from the correctness of its modules, without knowledge of their internal structure. The advantage of compositional verification is clear. Each module is both simpler and smaller than the system itself. Composition requires the use of both model-checking and deductive techniques. A refinement rule guarantees that specifications of high-level modules are preserved by their implementations. The StateTime toolset is used to automate parts of compositional designs using a combination of model-checking and simulation. The design method is illustrated using a reactor shutdown system that cannot be verified using the StateTime toolset (due to the combinatorial explosion of states) without compositional reasoning. The reactor example also illustrates the use of the refinement rule.
引用
收藏
页码:1 / 48
页数:48
相关论文
共 47 条
[1]   CONJOINING SPECIFICATIONS [J].
ABADI, M ;
LAMPORT, L .
ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1995, 17 (03) :507-534
[2]   Automatic symbolic verification of embedded systems [J].
Alur, R ;
Henzinger, TA ;
Ho, PH .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1996, 22 (03) :181-201
[3]  
ALUR R, 1996, LNCS, V1066
[4]  
[Anonymous], ADV SOFTWARE DEV SER
[5]  
Baeten J. C. M., 1996, Formal Aspects of Computing, V8, P188, DOI 10.1007/BF01214556
[6]   SYMBOLIC MODEL CHECKING - 1020 STATES AND BEYOND [J].
BURCH, JR ;
CLARKE, EM ;
MCMILLAN, KL ;
DILL, DL ;
HWANG, LJ .
INFORMATION AND COMPUTATION, 1992, 98 (02) :142-170
[7]  
CAMPOS SV, 1994, AMAST SERIES COMPUTI, V2
[8]  
Chandy K.M., 1988, Parallel Program Design: A Foundation
[9]  
CHANG EJ, 1995, THESIS STANFORD U
[10]  
CLEAVELAND R, 1996, LECT NOTES COMPUTER, V1102, P394