Scalable Underapproximative Verification of Stochastic LTI Systems using Convexity and Compactness

DOI10.1145/3178126.3178148zbMath1417.93338OpenAlexW2796084235MaRDI QIDQ4561425

Meeko M. K. Oishi, A. P. Vinod

Publication date: 6 December 2018

Published in: Proceedings of the 21st International Conference on Hybrid Systems: Computation and Control (part of CPS Week) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3178126.3178148

zbMATH Keywords

convex optimizationstochastic optimal controlstochastic reachability

Mathematics Subject Classification ID

Convex programming (90C25) Optimal stochastic control (93E20) Attainable sets, reachability (93B03)

Related Items (5)

Probabilistic reach-avoid problems in nondeterministic systems with time-varying targets and obstacles ⋮ Stochastic reachability of a target tube: theory and computation ⋮ Symbolic control for stochastic systems via finite parity games ⋮ Lagrangian approximations for stochastic reachability of a target tube ⋮ Automated verification and synthesis of stochastic hybrid systems: a survey

This page was built for publication: Scalable Underapproximative Verification of Stochastic LTI Systems using Convexity and Compactness