147 citations · 590 across the 30 of their papers we have counts for
Showing math.NAShow all
3 papers · 1 filter
math.NA2022★ 15 cited
Fully-Automated Verification of Linear Systems Using Inner- and Outer-Approximations of Reachable Sets
Mark Wetzlinger, Niklas Kochdumper, Stanley Bak +1
Reachability analysis is a formal method to guarantee safety of dynamical systems under the influence of uncertainties. A substantial bottleneck of all reachability algorithms is t…
math.NA2020★ 1 cited
Adaptive Parameter Tuning for Reachability Analysis of Linear Systems
Mark Wetzlinger, Niklas Kochdumper, Matthias Althoff
Despite the possibility to quickly compute reachable sets of large-scale linear systems, current methods are not yet widely applied by practitioners. The main reason for this is pr…
math.NA2017
Reachability Analysis of Large Linear Systems with Uncertain Inputs in the Krylov Subspace
Matthias Althoff
One often wishes for the ability to formally analyze large-scale systems---typically, however, one can either formally analyze a rather small system or informally analyze a large-s…