Reachability Analysis of Hybrid Systems Using Support Functions

DOI10.1007/978-3-642-02658-4_40zbMath1242.93059OpenAlexW1604596197MaRDI QIDQ3636880

Colas Le Guernic, Antoine Girard

Publication date: 30 June 2009

Published in: Computer Aided Verification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02658-4_40

Mathematics Subject Classification ID

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 (25)

Efficient polyhedral enclosures for the reachable set of nonlinear control systems ⋮ Finite data-rate feedback stabilization of switched and hybrid linear systems ⋮ Verification of Hybrid Systems ⋮ Conservative time discretization: a comparative study ⋮ Lie symmetries applied to interval integration ⋮ Computational techniques for reachability analysis of Max-Plus-Linear systems ⋮ Hybrid Tools for Hybrid Systems – Proving Stability and Safety at Once ⋮ Unbounded-Time Analysis of Guarded LTI Systems with Inputs by Abstract Acceleration ⋮ Hybrid zonotopes: A new set representation for reachability analysis of mixed logical dynamical systems ⋮ Fully-Automated Verification of Linear Systems Using Reachability Analysis with Support Functions ⋮ Formal verification and quantitative metrics of MPSoC data dynamics ⋮ A CSP versus a zonotope-based method for solving guard set intersection in nonlinear hybrid reachability ⋮ Rigorous Simulation-Based Analysis of Linear Hybrid Systems ⋮ Counterexample-Guided Refinement of Template Polyhedra ⋮ Reachability analysis of nonlinear systems using hybridization and dynamics scaling ⋮ Reachability computation for polynomial dynamical systems ⋮ Computing reachable states for nonlinear biological models ⋮ Unbounded-time safety verification of guarded LTI models with inputs by abstract acceleration ⋮ A zonotopic framework for functional abstractions ⋮ Efficient geometric operations on convex polyhedra, with an application to reachability analysis of hybrid systems ⋮ Falsification of hybrid systems with symbolic reachability analysis and trajectory splicing ⋮ Formal analysis of the Schulz matrix inversion algorithm: a paradigm towards computer aided verification of general matrix flow solvers ⋮ Construction of the minimum time function for linear systems via higher-order set-valued methods ⋮ Decomposing reach set computations with low-dimensional sets and high-dimensional matrices (extended version) ⋮ Lagrangian methods for approximating the viability kernel in high-dimensional systems

Uses Software

• PHAVer

This page was built for publication: Reachability Analysis of Hybrid Systems Using Support Functions