921 research outputs found
Reachability analysis of linear hybrid systems via block decomposition
Reachability analysis aims at identifying states reachable by a system within
a given time horizon. This task is known to be computationally expensive for
linear hybrid systems. Reachability analysis works by iteratively applying
continuous and discrete post operators to compute states reachable according to
continuous and discrete dynamics, respectively. In this paper, we enhance both
of these operators and make sure that most of the involved computations are
performed in low-dimensional state space. In particular, we improve the
continuous-post operator by performing computations in high-dimensional state
space only for time intervals relevant for the subsequent application of the
discrete-post operator. Furthermore, the new discrete-post operator performs
low-dimensional computations by leveraging the structure of the guard and
assignment of a considered transition. We illustrate the potential of our
approach on a number of challenging benchmarks.Comment: Accepted at EMSOFT 202
Reach Set Approximation through Decomposition with Low-dimensional Sets and High-dimensional Matrices
Approximating the set of reachable states of a dynamical system is an
algorithmic yet mathematically rigorous way to reason about its safety.
Although progress has been made in the development of efficient algorithms for
affine dynamical systems, available algorithms still lack scalability to ensure
their wide adoption in the industrial setting. While modern linear algebra
packages are efficient for matrices with tens of thousands of dimensions,
set-based image computations are limited to a few hundred. We propose to
decompose reach set computations such that set operations are performed in low
dimensions, while matrix operations like exponentiation are carried out in the
full dimension. Our method is applicable both in dense- and discrete-time
settings. For a set of standard benchmarks, it shows a speed-up of up to two
orders of magnitude compared to the respective state-of-the art tools, with
only modest losses in accuracy. For the dense-time case, we show an experiment
with more than 10.000 variables, roughly two orders of magnitude higher than
possible with previous approaches
A Taylor Function Calculus for Hybrid System Analysis: Validation in Coq
International audienceWe present a framework for the verification of the numerical algorithms used in Ariadne, a tool for analysis of nonlinear hybrid system. In particular, in Ariadne, smooth functions are approximated by Taylor models based on sparse polynomials. We use the Coq theorem prover for developing Taylor models as sparse polynomials with floating-point coefficients. This development is based on the formalisation of an abstract data type of basic floating-point arithmetic . We show how to devise a type of continuous function models and thereby parametrise the framework with respect to the used approximation, which will allow us to plug in alternatives to Taylor models
Reachability computation for polynomial dynamical systems
This paper is concerned with the problem of computing the bounded time reachable set of a polynomial discrete-time dynamical system. The problem is well-known for being difficult when nonlinear systems are considered. In this regard, we propose three reachability methods that differ in the set representation. The proposed algorithms adopt boxes, parallelotopes, and parallelotope bundles to construct flowpipes that contain the actual reachable sets. The latter is a new data structure for the symbolic representation of polytopes. Our methods exploit the Bernstein expansion of polynomials to bound the images of sets. The scalability and precision of the presented methods are analyzed on a number of dynamical systems, in comparison with other existing approaches
Functional sets with typed symbols: Framework and mixed Polynotopes for hybrid nonlinear reachability and filtering
Verification and synthesis of Cyber-Physical Systems (CPS) are challenging
and still raise numerous issues so far. In this paper, an original framework
with mixed sets defined as function images of symbol type domains is first
proposed. Syntax and semantics are explicitly distinguished. Then, both
continuous (interval) and discrete (signed, boolean) symbol types are used to
model dependencies through linear and polynomial functions, so leading to mixed
zonotopic and polynotopic sets. Polynotopes extend sparse polynomial zonotopes
with typed symbols. Polynotopes can both propagate a mixed encoding of
intervals and describe the behavior of logic gates. A functional completeness
result is given, as well as an inclusion method for elementary nonlinear and
switching functions. A Polynotopic Kalman Filter (PKF) is then proposed as a
hybrid nonlinear extension of Zonotopic Kalman Filters (ZKF). Bridges with a
stochastic uncertainty paradigm are outlined. Finally, several discrete,
continuous and hybrid numerical examples including comparisons illustrate the
effectiveness of the theoretical results.Comment: 21 pages, 8 figure
PolyARBerNN: A Neural Network Guided Solver and Optimizer for Bounded Polynomial Inequalities
Constraints solvers play a significant role in the analysis, synthesis, and
formal verification of complex embedded and cyber-physical systems. In this
paper, we study the problem of designing a scalable constraints solver for an
important class of constraints named polynomial constraint inequalities (also
known as non-linear real arithmetic theory). In this paper, we introduce a
solver named PolyARBerNN that uses convex polynomials as abstractions for
highly nonlinear polynomials. Such abstractions were previously shown to be
powerful to prune the search space and restrict the usage of sound and complete
solvers to small search spaces. Compared with the previous efforts on using
convex abstractions, PolyARBerNN provides three main contributions namely (i) a
neural network guided abstraction refinement procedure that helps selecting the
right abstraction out of a set of pre-defined abstractions, (ii) a Bernstein
polynomial-based search space pruning mechanism that can be used to compute
tight estimates of the polynomial maximum and minimum values which can be used
as an additional abstraction of the polynomials, and (iii) an optimizer that
transforms polynomial objective functions into polynomial constraints (on the
gradient of the objective function) whose solutions are guaranteed to be close
to the global optima. These enhancements together allowed the PolyARBerNN
solver to solve complex instances and scales more favorably compared to the
state-of-art non-linear real arithmetic solvers while maintaining the soundness
and completeness of the resulting solver. In particular, our test benches show
that PolyARBerNN achieved 100X speedup compared with Z3 8.9, Yices 2.6, and
NASALib (a solver that uses Bernstein expansion to solve multivariate
polynomial constraints) on a variety of standard test benches
- …