BACH: Bounded reachAbility CHecker for linear hybrid automata

Authors:
Lei Bu;You Li;Linzhang Wang;Xuandong Li
Affiliations:
Nanjing University, Nanjing, Jiangsu, P.R. China;Nanjing University, Nanjing, Jiangsu, P.R. China;Nanjing University, Nanjing, Jiangsu, P.R. China;Nanjing University, Nanjing, Jiangsu, P.R. China
Venue:
Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design
Year:
2008

Citing 7
Cited 3

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
Towards an Efficient Path-Oriented Tool for Bounded Reachability Analysis of Linear Hybrid Systems using Linear Programming

Electronic Notes in Theoretical Computer Science (ENTCS)
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

BACH 2: Bounded reachAbility CHecker for compositional linear hybrid systems

Proceedings of the Conference on Design, Automation and Test in Europe
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

Hybrid automata are well studied formal models for hybrid systems with both discrete and continuous state changes. However, the analysis of hybrid automata is quite difficult. Even for the simple class of linear hybrid automata, the reachability problem is undecidable. In the author's previous work, for linear hybrid automata we proposed a linear programming based approach to check one path at a time while the length of the path and the size of the automaton being checked can be large enough to handle problems of practical interest. Based on this approach, in this paper we present a prototype tool BACH to perform bounded reachability checking of linear hybrid automata. The experiment data shows that BACH has good performance and scalability, and supports our belief that BACH could become a powerful assistant to design engineers for the reachability analysis of linear hybrid automata.