Approximate Computation of Reach Sets in Hybrid Systems

Details Approximate Computation of Reach Sets in Hybrid Systems Approximate Computation of Reach Sets in Hybrid Systems

2002-02-07

arxiv.org/abs/cs/0202006v1

Computer Science

Logic in Computer Science

Scientific paper

One of the most important problems in hybrid systems is the {\em reachability problem}. The reachability problem has been shown to be undecidable even for a subclass of {\em linear} hybrid systems. In view of this, the main focus in the area of hybrid systems has been to find {\em effective} semi-decision procedures for this problem. Such an algorithmic approach involves finding methods of computation and representation of reach sets of the continuous variables within a discrete state of a hybrid system. In this paper, after presenting a brief introduction to hybrid systems and reachability problem, we propose a computational method for obtaining the reach sets of continuous variables in a hybrid system. In addition to this, we also describe a new algorithm to over-approximate with polyhedra the reach sets of the continuous variables with linear dynamics and polyhedral initial set. We illustrate these algorithms with typical interesting examples.

Affiliated with

Also associated with

No associations

Rating

Approximate Computation of Reach Sets in Hybrid Systems 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 Approximate Computation of Reach Sets in Hybrid Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximate Computation of Reach Sets in Hybrid Systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-648867