Lagrangian Reachtubes: The Next Generation

12/14/2020
by   Sophie A. Neubauer, et al.
5

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*.

READ FULL TEXT

page 1

page 7

page 8

page 9

research
05/16/2017

Lagrangian Reachabililty

We introduce LRT, a new Lagrangian-based ReachTube computation algorithm...
research
09/20/2018

Tight Continuous-Time Reachtubes for Lagrangian Reachability

We introduce continuous Lagrangian reachability (CLRT), a new algorithm ...
research
07/18/2021

GoTube: Scalable Stochastic Verification of Continuous-Depth Models

We introduce a new stochastic verification algorithm that formally quant...
research
03/02/2021

On the Size of Levenshtein Balls

The rapid development of DNA storage has brought the deletion and insert...
research
02/15/2023

High performance implementation of 3D FEM for nonlocal Poisson problem with different ball approximation strategies

Nonlocality brings many challenges to the implementation of finite eleme...
research
02/19/2020

The set of hyperbolic equilibria and of invertible zeros on the unit ball is computable

In this note, we construct an algorithm that, on input of a description ...
research
09/19/2021

Ontology-based n-ball Concept Embeddings Informing Few-shot Image Classification

We propose a novel framework named ViOCE that integrates ontology-based ...

Please sign up or login with your details

Forgot password? Click here to reset