Decomposing reach set computations with low-dimensional sets and high-dimensional matrices (extended version)
From MaRDI portal
Publication:2105418
DOI10.1016/J.IC.2022.104937OpenAlexW4284691246WikidataQ114172427 ScholiaQ114172427MaRDI QIDQ2105418FDOQ2105418
Authors: Sergiy Bogomolov, M. Forets, Goran Frehse, Andreas Podelski, Christian Schilling 
Publication date: 8 December 2022
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2022.104937
Recommendations
Cites Work
- Algorithm 919: A Krylov subspace algorithm for evaluating the \(\phi\)-functions appearing in exponential integrators
- Title not available (Why is that?)
- Julia: a fresh approach to numerical computing
- JuliaReach
- Title not available (Why is that?)
- Reachability analysis of linear systems using support functions
- Reachability Analysis of Hybrid Systems Using Support Functions
- Reachability Analysis Using Polygonal Projections
- Hybrid Systems: Computation and Control
- Hybrid Systems: Computation and Control
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
- A survey of model reduction methods for large-scale systems.
- Analysis of Some Krylov Subspace Approximations to the Matrix Exponential Operator
- From the zonotope construction to the Minkowski addition of convex polytopes
- Overapproximating reachable sets by Hamilton-Jacobi projections
- Title not available (Why is that?)
- Composing reachability analyses of hybrid systems for safety and stability
- Reachability Analysis of Nonlinear Differential-Algebraic Systems
- Hybrid Systems: Computation and Control
- Title not available (Why is that?)
- Hybrid Systems: Computation and Control
- Two Fast Algorithms for Sparse Matrices: Multiplication and Permuted Transposition
- Flowpipe approximation and clustering in space-time
- Arb: Efficient Arbitrary-Precision Midpoint-Radius Interval Arithmetic
- Thread modularity at many levels: a pearl in compositional verification
- Time-scale decomposition of the reachable set of constrained linear systems
- An algorithm for approximating polyhedra.
- The modified method of refined bounds for polyhedral approximation of convex polytopes
- Order-reduction abstractions for safety verification of high-dimensional linear systems
- Simulation-equivalent reachability of large linear systems with inputs
- Reach set approximation through decomposition with low-dimensional sets and high-dimensional matrices
- Numerical verification of affine systems with up to a billion dimensions
- Counterexample-Guided Refinement of Template Polyhedra
- Conservative time discretization: a comparative study
- Quasi-dependent variables in hybrid automata
- Eliminating spurious transitions in reachability with support functions
- Complexity reduction through a Schur-based decomposition for reachability analysis of linear time-invariant systems
- Asymptotics for singularly perturbed reachable sets
- The Reach-and-Evolve Algorithm for Reachability Analysis of Nonlinear Dynamical Systems
- Reachability Analysis of Large Linear Systems With Uncertain Inputs in the Krylov Subspace
Uses Software
This page was built for publication: Decomposing reach set computations with low-dimensional sets and high-dimensional matrices (extended version)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2105418)
