Path-oriented reachability verification of a class of nonlinear hybrid automata using convex programming

Authors:
Lei Bu;Jianhua Zhao;Xuandong Li
Affiliations:
State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, Jiangsu, P.R.China;State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, Jiangsu, P.R.China;State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, Jiangsu, P.R.China
Venue:
VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
Year:
2010

Citing 11
Cited 0

The algorithmic analysis of hybrid systems

Theoretical Computer Science - Special issue on hybrid systems
Counterexample-Guided Abstraction Refinement

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
The Quest for Efficient Boolean Satisfiability Solvers

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
The theory of hybrid automata

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Convex Optimization

Convex Optimization
Towards an Efficient Path-Oriented Tool for Bounded Reachability Analysis of Linear Hybrid Systems using Linear Programming

Electronic Notes in Theoretical Computer Science (ENTCS)
BACH: Bounded reachAbility CHecker for linear hybrid automata

Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design
Verifying Industrial Hybrid Systems with MathSAT

Electronic Notes in Theoretical Computer Science (ENTCS)
Efficient Proof Engines for Bounded Model Checking of Hybrid Systems

Electronic Notes in Theoretical Computer Science (ENTCS)
Reachability for linear hybrid automata using iterative relaxation abstraction

HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
PHAVer: algorithmic verification of hybrid systems past hytech

HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control

Quantified Score

Hi-index	0.00

Visualization

Abstract

Hybrid automata are well-studied formal models for dynamical systems. However, the analysis of hybrid automata is extremely difficult, and even state-of-the-art tools can only analyze systems with few continuous variables and simple dynamics. Because the reachability problem for general hybrid automata is undecidable, we give a path-oriented reachability analysis procedure for a class of nonlinear hybrid automata called convex hybrid automata. Our approach encodes the reachability problem along a path of a convex hybrid automaton as a convex feasibility problem, which can be efficiently solved by off-the-shelf convex solvers, such as CVX. Our path-oriented reachability verification approach can be applied in the frameworks of bounded model checking and counterexample-guided abstraction refinement with the goal of achieving significant performance improvement for this subclass of hybrid automata.