Design of a Distributed Reachability Algorithm for Analysis of Linear Hybrid Automata

Simple item page
dc.creatorJha, Sumit Kumar
dc.date2007-10-19
dc.date.accessioned2026-07-07T08:37:23Z
dc.date.available2026-07-07T08:37:23Z
dc.descriptionThis 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.
dc.description8 pages
dc.identifierhttps://arxiv.org/abs/0710.3764
dc.identifierhttp://arxiv.org/abs/0710.3764
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/140382
dc.subjectLogic in Computer Science
dc.titleDesign of a Distributed Reachability Algorithm for Analysis of Linear Hybrid Automata
dc.typetext

Files

Collections

arXiv