Robust Abstractions for Control Synthesis

DOI10.1145/3049797.3049826zbMath1369.93195arXiv1803.01387OpenAlexW4300362429MaRDI QIDQ5275323

Jun Liu

Publication date: 11 July 2017

Published in: Proceedings of the 20th International Conference on Hybrid Systems: Computation and Control (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1803.01387

zbMATH Keywords

robustnesscompletenessdecidabilityabstractionlinear temporal logiclinear-time propertycomputational control theorycomputer-aided control design

Mathematics Subject Classification ID

Sensitivity (robustness) (93B35) Nonlinear systems in control theory (93C10) Control/observation systems with incomplete information (93C41) Synthesis problems (93B50) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (4)

Robustly complete synthesis of sampled-data control for continuous-time nonlinear systems with reach-and-stay objectives ⋮ Closing the gap between discrete abstractions and continuous control: completeness via robustness and controllability ⋮ Lyapunov-barrier characterization of robust reach-avoid-stay specifications for hybrid systems ⋮ Robustly complete finite-state abstractions for verification of stochastic systems

Uses Software

• SCOTS

This page was built for publication: Robust Abstractions for Control Synthesis