Utilizing dependencies to obtain subsets of reachable sets
From MaRDI portal
Publication:5146360
DOI10.1145/3365365.3382192OpenAlexW2980770369MaRDI QIDQ5146360
Niklas Kochdumper, Bastian Schürmann, Matthias Althoff
Publication date: 25 January 2021
Published in: Proceedings of the 23rd International Conference on Hybrid Systems: Computation and Control (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.08354
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 (5)
Constrained polynomial zonotopes ⋮ Reachability Analysis for Linear Systems with Uncertain Parameters using Polynomial Zonotopes ⋮ Automatic Abstraction Refinement in Neural Network Verification using Sensitivity Analysis ⋮ Reachability of Koopman Linearized Systems Using Random Fourier Feature Observables and Polynomial Zonotope Refinement ⋮ Formal synthesis of closed-form sampled-data controllers for nonlinear continuous-time systems under STL specifications
This page was built for publication: Utilizing dependencies to obtain subsets of reachable sets