Reachability analysis of large linear systems with uncertain inputs in the krylov subspace

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-scale system. This paper tries to further close this performance gap for reachability analysis of linear systems. Reachability analysis can capture the whole set of possible solutions of a dynamic system and is thus used to prove that unsafe states are never reached; this requires full consideration of arbitrarily varying uncertain inputs, since sensor noise or disturbances usually do not follow any patterns. We use Krylov methods in this paper to compute reachable sets for large-scale linear systems. While Krylov methods have been used before in reachability analysis, we overcome the previous limitation that inputs must be (piecewise) constant. As a result, we can compute reachable sets of systems with several thousand state variables for bounded, but arbitrarily varying inputs.