A generic ellipsoid abstract domain for linear time invariant systems

DOI10.1145/2185632.2185651zbMath1362.93065OpenAlexW2016043649MaRDI QIDQ2986757

Pierre-Loïc Garoche, Pierre Roux, Eric Feron, Romain Jobredeaux

Publication date: 16 May 2017

Published in: Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control (Search for Journal in Brave)

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

zbMATH Keywords

Lyapunov functionsellipsoidssemi-definite programmingabstract interpretationquadratic invariantsstable linear systemsfloating point errors

Mathematics Subject Classification ID

Related Items (8)

Credible autocoding of convex optimization algorithms ⋮ A sums-of-squares extension of policy iterations ⋮ Practical policy iterations. A practical use of policy iterations for static analysis: the quadratic case ⋮ A piecewise ellipsoidal reachable set estimation method for continuous bimodal piecewise affine systems ⋮ Computation of invariant sets for discrete‐time uncertain systems ⋮ Automatic synthesis of \(k\)-inductive piecewise quadratic invariants for switched affine control programs ⋮ Numerical invariants through convex relaxation and max-strategy iteration ⋮ Policy iteration in finite templates domain

This page was built for publication: A generic ellipsoid abstract domain for linear time invariant systems