TY - GEN
T1 - Termination analysis of safety verification for non-linear robust hybrid systems
AU - She, Zhikun
PY - 2011
Y1 - 2011
N2 - Safety verification of hybrid systems is in general undecidable. Due to practical applications, it is sufficient to only consider robustly safe hybrid systems in which a slight perturbation is guaranteed to result in the same desired safety property. In this paper, we provide a constraint based abstraction refinement for safety verification of nonlinear hybrid systems and prove that this refinement procedure will terminate for robustly safe nonlinear hybrid systems.
AB - Safety verification of hybrid systems is in general undecidable. Due to practical applications, it is sufficient to only consider robustly safe hybrid systems in which a slight perturbation is guaranteed to result in the same desired safety property. In this paper, we provide a constraint based abstraction refinement for safety verification of nonlinear hybrid systems and prove that this refinement procedure will terminate for robustly safe nonlinear hybrid systems.
KW - Abstraction refinement
KW - Reachability constraints
KW - Robust hybrid systems
KW - Termination analysis
UR - https://www.scopus.com/pages/publications/80052558793
M3 - 会议稿件
AN - SCOPUS:80052558793
SN - 9789898425744
T3 - ICINCO 2011 - Proceedings of the 8th International Conference on Informatics in Control, Automation and Robotics
SP - 251
EP - 261
BT - ICINCO 2011 - Proceedings of the 8th International Conference on Informatics in Control, Automation and Robotics
T2 - 8th International Conference on Informatics in Control, Automation and Robotics, ICINCO 2011
Y2 - 28 July 2011 through 31 July 2011
ER -