A generic ellipsoid abstract domain for linear time invariant systems
DOI10.1145/2185632.2185651zbMATH Open1362.93065OpenAlexW2016043649MaRDI QIDQ2986757FDOQ2986757
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
Recommendations
- Automatic synthesis of piecewise linear quadratic invariants for programs
- Automatic synthesis of \(k\)-inductive piecewise quadratic invariants for switched affine control programs
- Computer Aided Verification
- Closed loop analysis of control command software
- Unbounded-time analysis of guarded LTI systems with inputs by abstract acceleration
Lyapunov functionsabstract interpretationsemi-definite programmingquadratic invariantsellipsoidsstable linear systemsfloating point errors
Cited In (9)
- A sums-of-squares extension of policy iterations
- Policy iteration in finite templates domain
- Set invariance and performance analysis of linear systems via truncated ellipsoids
- Numerical invariants through convex relaxation and max-strategy iteration
- Practical policy iterations. A practical use of policy iterations for static analysis: the quadratic case
- Credible autocoding of convex optimization algorithms
- Computation of invariant sets for discrete‐time uncertain systems
- A piecewise ellipsoidal reachable set estimation method for continuous bimodal piecewise affine systems
- Automatic synthesis of \(k\)-inductive piecewise quadratic invariants for switched affine control programs
This page was built for publication: A generic ellipsoid abstract domain for linear time invariant systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986757)
