Fully-Automated Verification of Linear Systems Using Reachability Analysis with Support Functions
DOI10.1145/3575870.3587121MaRDI QIDQ6202080FDOQ6202080
Matthias Althoff, Stanley Bak, Niklas Kochdumper, Mark Wetzlinger
Publication date: 21 February 2024
Published in: Proceedings of the 26th ACM International Conference on Hybrid Systems: Computation and Control (Search for Journal in Brave)
Full work available at URL: https://mediatum.ub.tum.de/1710697
set-based computingformal verificationiterative refinementhigh-dimensional systemsautomated parameter tuningcounterexample.
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hybrid Systems: Computation and Control
- JuliaReach
- Differential dynamic logic for hybrid systems
- A time-dependent Hamilton-Jacobi formulation of reachable sets for continuous dynamic games
- Hybrid Systems: Computation and Control
- Reachability analysis of linear systems using support functions
- Reachability Analysis of Hybrid Systems Using Support Functions
- Computational techniques for hybrid system verification
- A Framework for Worst-Case and Stochastic Safety Verification Using Barrier Certificates
- Hybrid Systems: Computation and Control
- Constrained zonotopes: a new tool for set-based estimation and fault detection
- Zonotope/Hyperplane Intersection for Hybrid Systems Reachability Analysis
- A note on regularity and positive definiteness of interval matrices
- Logical Analysis of Hybrid Systems
- A dynamic algorithm for approximate flow computations
- Hybrid Systems: Computation and Control
- Systematic Simulation Using Sensitivity Analysis
- Reachability analysis of continuous-time piecewise affine systems
- Flowpipe approximation and clustering in space-time
- Efficient dynamic error reduction for hybrid systems reachability analysis
- Parsimonious, Simulation Based Verification of Linear Systems
- Reachability Analysis for Solvable Dynamical Systems
- Simulation-equivalent reachability of large linear systems with inputs
- Counterexample-Guided Refinement of Template Polyhedra
- Adaptive reachability algorithms for nonlinear systems using abstraction error analysis
- Conservative time discretization: a comparative study
- Eliminating spurious transitions in reachability with support functions
- Ellipsotopes: Uniting Ellipsoids and Zonotopes for Reachability Analysis and Fault Detection
This page was built for publication: Fully-Automated Verification of Linear Systems Using Reachability Analysis with Support Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6202080)
