Lagrangian Reachtubes: The Next Generation
Not on the map. Why?
Abstract (arXiv)
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*.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). First posted on arXiv 14 Dec 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 4; 2022: 2; 2023: 2; 2024: 0; 2025: 1; 2026: 1.
10 papers.
- 2021Stability Verification in Stochastic Control Systems via Neural Network Supermartingalescited by 24
- 2022Reachability Analysis of a General Class of Neural Ordinary Differential Equationscited by 13
- 2021GoTube: Scalable Stochastic Verification of Continuous-Depth Modelscited by 12
- 2021Infinite Time Horizon Safety of Bayesian Neural Networkscited by 12
- 2021BarrierNet: A Safety-Guaranteed Layer for Neural Networkscited by 11
- 2022Safety Verification for Neural Networks Based on Set-boundary Analysiscited by 5
- 2023Verifying Safety of Neural Networks from Topological Perspectivescited by 1
- 2026TNODEV: Toolbox for Neural ODE Verificationcited by 1
- 2023Robustness Analysis of Continuous-Depth Models with Lagrangian Techniquescited by 0
- 2025TubeDAgger: Reducing the Number of Expert Interventions with Stochastic Reach-Tubescited by 0
- 2026TNODEV: Toolbox for Neural ODE Verification15 Jun 2026
- 2025TubeDAgger: Reducing the Number of Expert Interventions with Stochastic Reach-Tubes1 Oct 2025
- 2023Robustness Analysis of Continuous-Depth Models with Lagrangian Techniques23 Aug 2023
- 2023Verifying Safety of Neural Networks from Topological Perspectives27 Jun 2023
- 2022Safety Verification for Neural Networks Based on Set-boundary Analysis9 Oct 2022
- 2022Reachability Analysis of a General Class of Neural Ordinary Differential Equations13 Jul 2022
- 2021Stability Verification in Stochastic Control Systems via Neural Network Supermartingales17 Dec 2021
- 2021BarrierNet: A Safety-Guaranteed Layer for Neural Networks22 Nov 2021
- 2021Infinite Time Horizon Safety of Bayesian Neural Networks4 Nov 2021
- 2021GoTube: Scalable Stochastic Verification of Continuous-Depth Models18 Jul 2021