Symbolic model checking for event-driven real-time systems

被引:22
作者
Yang, J [1 ]
Mok, AK [1 ]
Wang, F [1 ]
机构
[1] ACAD SINICA,INST INFORMAT SCI,TAIPEI 11529,TAIWAN
来源
ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS | 1997年 / 19卷 / 02期
关键词
languages; verification; binary decision diagrams; real-time verification; symbolic model checking; synchronous real-time event logic;
D O I
10.1145/244795.244803
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
In this article, we consider symbolic model checking for event-driven real-time systems. We first propose a Synchronous Real-Time Event Logic (SREL) for capturing the formal semantics of synchronous, event-driven real-time systems. The concrete syntax of these systems is given in terms of a graphical programming language called Modechart hy Jahanian and Mok, which can be translated into SREL structures. We then present a symbolic model-checking algorithm for SREL. In particular, we give an efficient algorithm for constructing OBDDs (ordered Binary Decision Diagrams) for linear constraints among integer variables. This is very important in a BDD-based symbolic model checker for real-time systems, since timing and event occurrence constraints are used very often in the specification of these systems. We have incorporated our construction algorithm into the SMV v2.3 from Carnegie-Mellon University and have been able to achieve one to two orders of magnitude in speedup and space saving when compared to the implementation of timing and event-counting functions by integer arithmetics provided by SMV.
引用
收藏
页码:386 / 412
页数:27
相关论文
共 24 条
[1]  
ALUR R, 1990, P 5 IEEE S LOG COMP
[2]  
ALUR R, 1993, 14TH P ANN REAL TIM, P2
[3]  
Bryant RE, 1986, IEEE T COMPUT, VC-35, P8
[4]  
BURCH JR, 1990, P 5 IEEE S LOG COMP
[5]  
CAMPOS S, 1994, P 15 IEEE REAL TIM S
[6]  
CLARKE EM, 1991, C P ROYAL SOC LOND
[7]  
CLARKE EM, 1981, LECT NOTES COMPUTER, V131
[8]  
CLARKE EM, 1986, ACM T PROGR LANG SYS, V8, P2
[9]  
CLARKE EM, 1995, ICCAD 95
[10]  
COUDERT O, 1989, LECT NOTES COMPUTER, V407