Computing finite abstractions with robustness margins via local reachable set over-approximation**This work is supported, in part, by EU FP7 Grant PCIG13-GA-2013-61737 and NSF grant CNS-1446298.
Authors:
- Yinan LiYLYinan Li
- Jun LiuJLJun Liu
- Necmiye OzayNONecmiye Ozay
- 1 January 2015
- journal article
- Published by Elsevier in IFAC-PapersOnLine
- Vol. 48 (27) , 1-6
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Abstraction, discretization, and robustness in temporal logic control of dynamical systems | Proceedings of the 17th international conference on Hybrid systems: computation and control2014
- Reachability Analysis of Nonlinear Differential-Algebraic SystemsIEEE Transactions on Automatic Control, 2013
- Computing augmented finite transition systems to synthesize switching protocols for polynomial switched systems2013
- Synthesis of Reactive Switching Protocols From Temporal Logic SpecificationsIEEE Transactions on Automatic Control, 2013
- Approximately Bisimilar Symbolic Models for Incrementally Stable Switched SystemsIEEE Transactions on Automatic Control, 2009
- A Fully Automated Framework for Control of Linear Systems from Temporal Logic SpecificationsIEEE Transactions on Automatic Control, 2008
- Efficient Computation of Reachable Sets of Linear Time-Invariant Systems with Inputs2006
- Reachability of Uncertain Linear Systems Using Zonotopes2005
- A Lyapunov approach to incremental stability propertiesIEEE Transactions on Automatic Control, 2002
- Discrete abstractions of hybrid systemsProceedings of the IEEE, 2000