201. Towards an Efficient Path-Oriented Tool for Bounded Reachability Analysis of Linear Hybrid Systems using Linear Programming
- Author
-
Lei Bu, Xuandong Li, and Sumit Jha Aanand
- Subjects
Linear hybrid automata ,Theoretical computer science ,Correctness ,General Computer Science ,Linear programming ,linear programming ,Symbolic execution ,bounded model checking ,Theoretical Computer Science ,Automaton ,reachability analysis ,Reachability ,Hybrid system ,Path (graph theory) ,Hybrid automaton ,Computer Science(all) ,Mathematics - 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.
- Published
- 2007
- Full Text
- View/download PDF