DMCA
Reachability Computation For Linear Hybrid Systems (1998)
| Venue: | In Proceedings of the 14th IFAC World Congress, volume E |
| Citations: | 12 - 3 self |
BibTeX
@INPROCEEDINGS{Lafferriere98reachabilitycomputation,
author = {Gerardo Lafferriere and George J. Pappas and Sergio Yovine},
title = {Reachability Computation For Linear Hybrid Systems},
booktitle = {In Proceedings of the 14th IFAC World Congress, volume E},
year = {1998},
pages = {7--12},
publisher = {Elsevier Science Ltd}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
: Linear hybrid systems are finite state machines with linear vector fields of the form x = Ax in each discrete location. Very recently, the reachability problem for classes of linear hybrid systems was shown to be decidable. In this paper, the decidability result is extended to capture classes of linear hybrid systems where in each location the dynamics are of the form x = Ax +Bu, for various types of inputs. Keywords: Reachability, linear systems, finite state machines. 1. INTRODUCTION Hybrid systems combine discrete event systems with differential equations. One of the most important problems for hybrid systems is the reachability problem which asks whether some unsafe region is reachable from an initial region. The reachability problem for hybrid systems is known to be difficult. In order to tackle the complexity of the reachability problem, we adopt a computational point of view. The important issue for computational algorithms for systems with infinite state spaces is decidabil...
Keyphrases
linear hybrid system reachability problem reachability computation finite state machine hybrid system decidability result linear vector field linear system differential equation important problem various type form ax infinite state space computational point discrete event system unsafe region form ax bu important issue initial region introduction hybrid system computational algorithm discrete location
