Numerical Verification of 10000-dimensional Linear Systems 10000x Faster

Tool Presentation: We evaluate an improved reachability algorithm for linear (and affine) systems implemented in the continuous branch of the Hylaa tool. While Hylaa’s earlier approach required n simulations to verify an n-dimensional system, the new method takes advantage of additional problem structure to produce the same verification result in significantly less time. If the initial states can be defined in i dimensions, and the output variables related to the property being checked are o-dimensional, the new approach needs only min(i, o) simulations to verify the system, or produce a counter-example. In addition to reducing the number of simulations, a second improvement speeds up individual simulations when the dynamics is sparse by using Krylov subspace methods. At ARCH 2017, we used the original approach to verify nine large linear benchmarks taken from model order reduction. Here, we run the new algorithm on the same set of benchmarks, and get an identical verification result in a fraction of the time. None of the benchmarks need more than tens of seconds to complete. The largest system with 10922 dimensions, which took over 24 hours using last year’s method, is verified in 3.4 seconds.