Decomposing reach set computations with low-dimensional sets and high-dimensional matrices (extended version)
type: Item
instance of: scholarly article
title: Decomposing reach set computations with low-dimensional sets and high-dimensional matrices (extended version)
author: Sergiy Bogomolov
author: M. Forets
author: Goran Frehse
author: Andreas Podelski
author: Christian Schilling
published in: Information and Computation
publication date: 2022-12-08T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7629131
zbMATH Keywords: linear time-invariant systems
zbMATH Keywords: reachability analysis
zbMATH Keywords: safety verification
zbMATH Keywords: set recurrence relation
describes a project that uses: SLICOT
describes a project that uses: Arb
describes a project that uses: Julia
describes a project that uses: Mjollnir
describes a project that uses: XSpeed
describes a project that uses: DifferentialEquations.jl
describes a project that uses: LAPACK
describes a project that uses: Algorithm 919
describes a project that uses: Lazysets.jl
describes a project that uses: NeuralPDE.jl
describes a project that uses: phipm
describes a project that uses: SpaceEx
describes a project that uses: Ellipsoidal Toolbox
describes a project that uses: JuliaReach
describes a project that uses: benchmodred
MaRDI profile type: Publication
full work available at URL: j.ic.2022.104937
OpenAlex ID: W4284691246
Wikidata QID: Q114172427
cites work: Hybrid Systems: Computation and Control
cites work: Q4953393
cites work: Reachability Analysis of Nonlinear Differential-Algebraic Systems
cites work: Reachability analysis of linear systems using support functions
cites work: Flowpipe approximation and clustering in space-time
cites work: Eliminating spurious transitions in reachability with support functions
cites work: Counterexample-Guided Refinement of Template Polyhedra
cites work: Q4953376
cites work: Reachability Analysis of Hybrid Systems Using Support Functions
cites work: Reach Set Approximation through Decomposition with Low-dimensional Sets and High-dimensional Matrices
cites work: Complexity reduction through a Schur-based decomposition for reachability analysis of linear time-invariant systems
cites work: Time-scale decomposition of the reachable set of constrained linear systems
cites work: Asymptotics for Singularly Perturbed Reachable Sets
cites work: Reachability Analysis Using Polygonal Projections
cites work: A survey of model reduction methods for large-scale systems.
cites work: Order-reduction abstractions for safety verification of high-dimensional linear systems
cites work: Composing Reachability Analyses of Hybrid Systems for Safety and Stability
cites work: Quasi-dependent variables in hybrid automata
cites work: Simulation-equivalent reachability of large linear systems with inputs
cites work: Numerical verification of affine systems with up to a billion dimensions
cites work: Overapproximating reachable sets by Hamilton-Jacobi projections
cites work: The Reach-and-Evolve Algorithm for Reachability Analysis of Nonlinear Dynamical Systems
cites work: Arb: Efficient Arbitrary-Precision Midpoint-Radius Interval Arithmetic
cites work: An algorithm for approximating polyhedra.
cites work: The modified method of refined bounds for polyhedral approximation of convex polytopes
cites work: Conservative time discretization: a comparative study
cites work: From the zonotope construction to the Minkowski addition of convex polytopes
cites work: Julia: A Fresh Approach to Numerical Computing
cites work: The principle of minimized iterations in the solution of the matrix eigenvalue problem
cites work: Analysis of Some Krylov Subspace Approximations to the Matrix Exponential Operator
cites work: Reachability Analysis of Large Linear Systems With Uncertain Inputs in the Krylov Subspace
cites work: Two Fast Algorithms for Sparse Matrices: Multiplication and Permuted Transposition
cites work: JuliaReach
cites work: Q4952745
cites work: Q5701670
cites work: Algorithm 919
cites work: Thread modularity at many levels: a pearl in compositional verification
DOI: 10.1016/J.IC.2022.104937
description: scientific article; zbMATH DE number 7629131