Design of a Distributed Reachability Algorithm for Analysis of Linear Hybrid Automata
Logic in Computer Science
2007-10-22 v1
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 computational 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.
Cite
@article{arxiv.0710.3764,
title = {Design of a Distributed Reachability Algorithm for Analysis of Linear Hybrid Automata},
author = {Sumit Kumar Jha},
journal= {arXiv preprint arXiv:0710.3764},
year = {2007}
}
Comments
8 pages