TY - GEN
T1 - Recent progress in continuous and hybrid reachability analysis
AU - Asarin, Eugene
AU - Dang, Thao
AU - Frehse, Goran
AU - Girard, Antoine
AU - Le Guernic, Colas
AU - Maler, Oded
PY - 2007/12/1
Y1 - 2007/12/1
N2 - Set-based reachability analysis computes all possible states a system may attain, and in this sense provides knowledge about the system with a completeness, or coverage, that a finite number of simulation runs can not deliver. Due to its inherent complexity, the application of reachability analysis has been limited so far to simple systems, both in the continuous and the hybrid domain. In this paper we present recent advances that, in combination, significantly improve this applicability, and allow us to find better balance between computational cost and accuracy. The presentation covers, in a unified manner, a variety of methods handling increasingly complex types of continuous dynamics (constant derivative, linear, nonlinear). The improvements include new geometrical objects for representing sets, new approximation schemes, and more flexible combinations of graph-search algorithm and partition refinement. We report briefly some preliminary experiments that have enabled the analysis of systems previously beyond reach.
AB - Set-based reachability analysis computes all possible states a system may attain, and in this sense provides knowledge about the system with a completeness, or coverage, that a finite number of simulation runs can not deliver. Due to its inherent complexity, the application of reachability analysis has been limited so far to simple systems, both in the continuous and the hybrid domain. In this paper we present recent advances that, in combination, significantly improve this applicability, and allow us to find better balance between computational cost and accuracy. The presentation covers, in a unified manner, a variety of methods handling increasingly complex types of continuous dynamics (constant derivative, linear, nonlinear). The improvements include new geometrical objects for representing sets, new approximation schemes, and more flexible combinations of graph-search algorithm and partition refinement. We report briefly some preliminary experiments that have enabled the analysis of systems previously beyond reach.
U2 - 10.1109/CACSD.2006.285494
DO - 10.1109/CACSD.2006.285494
M3 - Conference contribution
AN - SCOPUS:43049164066
SN - 0780397975
SN - 9780780397972
T3 - Proceedings of the 2006 IEEE Conference on Computer Aided Control Systems Design, CACSD
SP - 1582
EP - 1587
BT - Proceedings of the 2006 IEEE Conference on Computer Aided Control Systems Design, CACSD
T2 - Joint 2006 IEEE Conference on Control Applications (CCA), Computer-Aided Control Systems Design Symposium (CACSD) and International Symposium on Intelligent Control (ISIC)
Y2 - 4 October 2006 through 6 October 2006
ER -