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

Authors:
Sumit Kumar Jha
Affiliations:
Computer Science Department, Carnegie Mellon University, Pittsburgh, PA 15213
Venue:
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
Year:
2008

Citing 5
Cited 1

Automatic analysis of hybrid systems

Automatic analysis of hybrid systems
Model checking

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

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

Distributed and predictable software model checking

VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents the design of a novel distributed algorithm d-IRA for the reachability analysis of linear hybrid automata. Recent work on iterative relaxation abstraction(IRA) is leveraged to distribute the reachability problem among multiple computational nodes in a non-redundant manner by performing careful infeasibility analysis of linear programs corresponding to spurious counterexamples. The d-IRA algorithm is resistant to failure of multiple computational nodes. The experimental results provide promising evidence for the possible successful application of this technique.