Name
Abstract | ||
|---|---|---|
One of the key problems in the safety analysis of control systems is the exact computation of reachable state spaces for continuous-time systems. Issues related to the controllability and observability of these systems are well-studied in systems theory. However, there are not many results on reachability, even for general linear systems. In this study, we present a large class of linear systems with decidable reachable state spaces. This is approached by reducing the reachability analysis to real root isolation of exponential polynomials. Furthermore, we have implemented this method in a Maple package based on symbolic computation and applied to several examples successfully. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1080/00207720903480691 | Int. J. Systems Science |
Keywords | Field | DocType |
maple package,reachability analysis,symbolic computation,general linear system,exact computation,linear system,safety analysis,decidable reachable state space,reachable state space,rational eigenvalue linear system,systems theory,control system,interval arithmetic,exponential polynomials,system theory,state space,eigenvalues,linear systems,continued fraction,continued fractions | Observability,Mathematical optimization,Systems theory,Algebra,Controllability,Linear system,Algorithm,Symbolic computation,Decidability,Reachability,State space,Mathematics | Journal |
Volume | Issue | ISSN |
41 | 12 | 0020-7721 |
Citations | PageRank | References |
7 | 0.52 | 12 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ming Xu | 1 | 7 | 0.52 |
| Liangyu Chen | 2 | 16 | 3.79 |
| Zhenbing Zeng | 3 | 150 | 20.48 |
| Zhibin Li | 4 | 115 | 23.77 |