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

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

2007-10-19

arxiv.org/abs/0710.3764v1

Computer Science

Logic in Computer Science

8 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Design of a Distributed Reachability Algorithm for Analysis of Linear Hybrid Automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Design of a Distributed Reachability Algorithm for Analysis of Linear Hybrid Automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Design of a Distributed Reachability Algorithm for Analysis of Linear Hybrid Automata will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-708930