Lagrangian Reachtubes: The Next Generation

We introduce LRT-NG, a set of techniques and an associated toolset that computes a reachtube (an over-approximation of the set of reachable states over a given time horizon) of a nonlinear dynamical system. LRT-NG significantly advances the state-of-the-art Langrangian Reachability and its associated tool LRT. From a theoretical perspective, LRT-NG is superior to LRT in three ways. First, it uses for the first time an analytically computed metric for the propagated ball which is proven to minimize the ball’s volume. We emphasize that the metric computation is the centerpiece of all bloating-based techniques. Secondly, it computes the next reachset as the intersection of two balls: one based on the Cartesian metric and the other on the new metric. While the two metrics were previously considered opposing approaches, their joint use considerably tightens the reachtubes. Thirdly, it avoids the "wrapping effect" associated with the validated integration of the center of the reachset, by optimally absorbing the interval approximation in the radius of the next ball. From a tool-development perspective, LRT-NG is superior to LRT in two ways. First, it is a standalone tool that no longer relies on CAPD. This required the implementation of the Lohner method and a Runge-Kutta time-propagation method. Secondly, it has an improved interface, allowing the input model and initial conditions to be provided as external input files. Our experiments on a comprehensive set of benchmarks, including two Neural ODEs, demonstrates LRT-NG’s superior performance compared to LRT, CAPD, and Flow*.

[1]  Radu Grosu,et al.  Tight Continuous-Time Reachtubes for Lagrangian Reachability , 2018, 2018 IEEE Conference on Decision and Control (CDC).

[2]  N. Nedialkov,et al.  Interval Tools for ODEs and DAEs , 2006, 12th GAMM - IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics (SCAN 2006).

[3]  J. Butcher Coefficients for the study of Runge-Kutta integration processes , 1963, Journal of the Australian Mathematical Society.

[4]  A. Spencer Continuum Mechanics , 1967, Nature.

[5]  Antonio Eduardo Carrilho da Cunha,et al.  Benchmark: Quadrotor Attitude Control , 2015, ARCH@CPSWeek.

[6]  Thomas A. Henzinger,et al.  Reachable Set Over-Approximation for Nonlinear Systems Using Piecewise Barrier Tubes , 2018, CAV.

[7]  C. Runge Ueber die numerische Auflösung von Differentialgleichungen , 1895 .

[8]  J. Achenbach THE LINEARIZED THEORY OF ELASTICITY , 1973 .

[9]  Nedialko S. Nedialkov,et al.  Some recent advances in validated methods for IVPs for ODEs , 2002 .

[10]  Radu Grosu,et al.  Under the Hood of a Stand-Alone Lagrangian Reachability Tool , 2019, ARCH@CPSIoTWeek.

[11]  Luca Cardelli,et al.  Maximal aggregation of polynomial dynamical systems , 2017, Proceedings of the National Academy of Sciences.

[12]  Antoine Girard,et al.  Compositionality results for cardiac cell dynamics , 2014, HSCC.

[13]  Julien Alexandre Dit Sandretto,et al.  Validated Explicit and Implicit Runge-Kutta Methods , 2016 .

[14]  Antoine Girard,et al.  SpaceEx: Scalable Verification of Hybrid Systems , 2011, CAV.

[15]  Piotr Zgliczynski,et al.  C1 Lohner Algorithm , 2002, Found. Comput. Math..

[16]  Matthias Althoff,et al.  Implementation of Taylor models in CORA 2018 , 2018, ARCH@ADHS.

[17]  Ian M. Mitchell,et al.  Overapproximating Reachable Sets by Hamilton-Jacobi Projections , 2003, J. Sci. Comput..

[18]  James Kapinski,et al.  Simulation-Driven Reachability Using Matrix Measures , 2017, ACM Trans. Embed. Comput. Syst..

[19]  David Angeli,et al.  A characterization of integral input-to-state stability , 2000, IEEE Trans. Autom. Control..

[20]  Thomas A. Henzinger,et al.  Piecewise Robust Barrier Tubes for Nonlinear Hybrid Systems with Uncertainty , 2019, FORMATS.

[21]  Chuchu Fan,et al.  Bounded Verification with On-the-Fly Discrepancy Computation , 2015, ATVA.

[22]  Mo Chen,et al.  Hamilton-Jacobi reachability: A brief overview and recent advances , 2017, 2017 IEEE 56th Annual Conference on Decision and Control (CDC).

[23]  D. Schaeffer,et al.  A two-current model for the dynamics of cardiac membrane , 2003, Bulletin of mathematical biology.

[24]  Oded Maler,et al.  Systematic Simulation Using Sensitivity Analysis , 2007, HSCC.

[25]  S. Rump Computational error bounds for multiple or nearly multiple eigenvalues , 2001 .

[26]  Ezio Bartocci,et al.  Model-order reduction of ion channel dynamics using approximate bisimulation , 2015, Theor. Comput. Sci..

[27]  D. Wilczak,et al.  Cr-Lohner algorithm , 2011 .

[28]  Xin Chen,et al.  Flow*: An Analyzer for Non-linear Hybrid Systems , 2013, CAV.

[29]  John N. Maidens,et al.  Reachability Analysis of Nonlinear Systems Using Matrix Measures , 2015, IEEE Transactions on Automatic Control.

[30]  Mirco Tribastone,et al.  Approximate Reduction of Heterogenous Nonlinear Models With Differential Hulls , 2016, IEEE Transactions on Automatic Control.

[31]  James Kapinski,et al.  Locally optimal reach set over-approximation for nonlinear systems , 2016, 2016 International Conference on Embedded Software (EMSOFT).

[32]  J. Rohn Bounds on Eigenvalues of Interval Matrices , 1998 .

[33]  Richard S. Sutton,et al.  Neuronlike adaptive elements that can solve difficult learning control problems , 1983, IEEE Transactions on Systems, Man, and Cybernetics.

[34]  David Duvenaud,et al.  Neural Ordinary Differential Equations , 2018, NeurIPS.

[35]  M. Berz,et al.  TAYLOR MODELS AND OTHER VALIDATED FUNCTIONAL INCLUSION METHODS , 2003 .

[36]  Milan Hladík,et al.  Bounds on Real Eigenvalues and Singular Values of Interval Matrices , 2010, SIAM J. Matrix Anal. Appl..

[37]  Bin Dong,et al.  Beyond Finite Layer Neural Networks: Bridging Deep Architectures and Numerical Differential Equations , 2017, ICML.

[38]  Ezio Bartocci,et al.  From Cardiac Cells to Genetic Regulatory Networks , 2011, CAV.

[39]  Alexandre Donzé,et al.  Breach, A Toolbox for Verification and Parameter Synthesis of Hybrid Systems , 2010, CAV.

[40]  Radu Grosu,et al.  Lagrangian Reachabililty , 2017, CAV.

[41]  Radu Grosu,et al.  Designing Worm-inspired Neural Networks for Interpretable Robotic Control , 2019, 2019 International Conference on Robotics and Automation (ICRA).