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

Authors:
Xuandong Li;Sumit Jha Aanand;Lei Bu
Affiliations:
State Key Laboratory of Novel Software Technology, Department of Computer Science and Technology, Nanjing University, Nanjing, Jiangsu, P.R.China 210092 and Computer Science Department, Carnegie M ...;Computer Science Department, Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, PA15213, USA;State Key Laboratory of Novel Software Technology, Department of Computer Science and Technology, Nanjing University, Nanjing, Jiangsu, P.R.China 210092
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2007

Citing 6
Cited 4

The algorithmic analysis of hybrid systems

Theoretical Computer Science - Special issue on hybrid systems
What's decidable about hybrid automata?

Journal of Computer and System Sciences
The theory of hybrid automata

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
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)
PHAVer: algorithmic verification of hybrid systems past hytech

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

d-IRA: A Distributed Reachability Algorithm for Analysis of Linear Hybrid Automata

HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
BACH: Bounded reachAbility CHecker for linear hybrid automata

Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design
Path-oriented reachability verification of a class of nonlinear hybrid automata using convex programming

VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
IIS-Guided DFS for efficient bounded reachability analysis of linear hybrid automata

HVC'11 Proceedings of the 7th international Haifa Verification conference on Hardware and Software: verification and testing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The existing techniques for reachability analysis of linear hybrid automata do not scale well to problem sizes of practical interest. Instead of developing a tool to perform reachability check on all the paths of a linear hybrid automaton, a complementary approach is to develop an efficient path-oriented tool to check one path at a time where the length of the path being checked can be made very large and the size of the automaton can be made large enough to handle problems of practical interest. This approach of symbolic execution of paths can be used by design engineers to check important paths and thereby, increase the faith in the correctness of the system. Unlike simple testing, each path in our framework represents a dense set of possible trajectories of the system being analyzed. In this paper, we develop the linear programming based techniques towards an efficient path-oriented tool for the bounded reachability analysis of linear hybrid systems.