Safety verification of hybrid systems by constraint propagation-based abstraction refinement

被引:117
作者
Ratschan, Stefan [1 ]
She, Zhikun [2 ]
机构
[1] Acad Sci Czech Republ, Inst Comp Sci, Prague, Czech Republic
[2] Beihang Univ, Sch Sci, Beijing, Peoples R China
关键词
algorithms; reliability; verification; hybrid systems; intervals; constraint propagation;
D O I
10.1145/1210268.1210276
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
This paper deals with the problem of safety verification of nonlinear hybrid systems. We start from a classical method that uses interval arithmetic to check whether trajectories can move over the boundaries in a rectangular grid. We put this method into an abstraction refinement framework and improve it by developing an additional refinement step that employs interval-constraint propagation to add information to the abstraction without introducing new grid elements. Moreover, the resulting method allows switching conditions, initial states, and unsafe states to be described by complex constraints, instead of sets that correspond to grid elements. Nevertheless, the method can be easily implemented, since it is based on a well-defined set of constraints, on which one can run any constraint propagation-based solver. Tests of such an implementation are promising.
引用
收藏
页数:23
相关论文
共 56 条
[1]  
Alur R, 2003, LECT NOTES COMPUT SC, V2619, P208
[2]  
ALUR R, 2002, REACHABILITY ANAL HY
[3]  
ALUR R, 2004, LNCS, V2993
[4]  
[Anonymous], RSOLVER
[5]   The essence of constraint propagation [J].
Apt, KR .
THEORETICAL COMPUTER SCIENCE, 1999, 221 (1-2) :179-210
[6]  
ASARIN E, 2002, LNCS, V2404, P365, DOI DOI 10.1007/3-540-45657-0_30
[7]  
Bayen AM, 2002, LECT NOTES COMPUT SC, V2289, P90
[8]   Applying interval arithmetic to real, integer, and Boolean constraints [J].
Benhamou, F ;
Older, WJ .
JOURNAL OF LOGIC PROGRAMMING, 1997, 32 (01) :1-24
[9]  
BENHAMOU F, 1994, MIT PS LOG, P124
[10]  
BENHAMOU F, 1996, LNCS, V1139