Inner and outer reachability for the verification of control systems

DOI10.1145/3302504.3311794OpenAlexW2936781873MaRDI QIDQ5239214

Eric Goubault, Sylvie Putot

Publication date: 22 October 2019

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

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

zbMATH Keywords

robustnessreachability analysissafety verificationTaylor modelsabstractionsunder-approximationinner-approximation

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)

Related Items (3)

OURS: over- and under-approximating reachable sets for analytic time-invariant differential equations ⋮ A few lessons learned in reinforcement learning for quadcopter attitude control ⋮ Switching controller synthesis for delay hybrid systems under perturbations

This page was built for publication: Inner and outer reachability for the verification of control systems