On Reachability for Hybrid Automata over Bounded Time

Details On Reachability for Hybrid Automata over Bounded Time On Reachability for Hybrid Automata over Bounded Time

2011-04-28

arxiv.org/abs/1104.5335v1

Proceedings of ICALP 2011, LNCS

Computer Science

Logic in Computer Science

20 pages. Full version of the ICALP 2011 proceedings paper

Scientific paper

This paper investigates the time-bounded version of the reachability problem for hybrid automata. This problem asks whether a given hybrid automaton can reach a given target location within T time units, where T is a constant rational value. We show that, in contrast to the classical (unbounded) reachability problem, the timed-bounded version is decidable for rectangular hybrid automata provided only non-negative rates are allowed. This class of systems is of practical interest and subsumes, among others, the class of stopwatch automata. We also show that the problem becomes undecidable if either diagonal constraints or both negative and positive rates are allowed.

Affiliated with

Also associated with

No associations

Rating

On Reachability for Hybrid Automata over Bounded Time 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 On Reachability for Hybrid Automata over Bounded Time, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Reachability for Hybrid Automata over Bounded Time will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-449182