Efficient reachability analysis of parametric linear hybrid systems with time-triggered transitions

  title={Efficient reachability analysis of parametric linear hybrid systems with time-triggered transitions},
  author={M. Forets and Daniel Freire and Christian Schilling},
  journal={2020 18th ACM-IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE)},
Efficiently handling time-triggered and possibly nondeterministic switches for hybrid systems reachability is a challenging task. In this paper we focus on periodically controlled systems with fast-switching controller dynamics, which often require simulation time scales of the order of nanoseconds. Accurate set-based computations for such systems with relatively large time horizons are expensive due to the accumulation of errors in the discrete transitions. We present an approach based on… 

Figures and Tables from this paper

LazySets.jl: Scalable Symbolic-Numeric Set Computations

The basic functionality of LazySets is showcased, highlighting some of the key design choices and its scope goes beyond reachability and formal verification to include computations that mix symbolics and numerics.



Verifying Properties of an Electro-Mechanical Braking System

This report applies the hybrid verification tools iSAT-ODE, Flow*, and S-TaLiRo to a case study consisting of an experimental electro-mechanical braking system and describes the derivation of hybrid automaton models for plant and controller.

Verifying properties of an electromechanical braking system

  • ARCH@CPSWeek, 2015.
  • 2015

Reachability Analysis of Hybrid Automata with Clocked Linear Dynamics

This paper presents a reachability algorithm which exploits the explicit separation of clock and non-clock variables in the Hybrid Automata with Clocked Linear Dynamics (HA-CLD) subclass, as well as restricting that guard and invariant constraints can only be specified in the HA- CLD model for clock variables.

Reachability Analysis of Linear Hybrid Systems via Block Decomposition

This article improves the continuous-post operator by performing computations in high-dimensional state space only for time intervals relevant for the subsequent application of the discrete-posts operator and introduces a new discrete- post operator that performs low-dimensional computations.

JuliaReach: a toolbox for set-based reachability

The choice of the programming language Julia and the accompanying documentation of the toolbox allow researchers to easily translate set-based algorithms from mathematics to software in a platform-independent way, while achieving runtime performance that is comparable to statically compiled languages.

Reach Set Approximation through Decomposition with Low-dimensional Sets and High-dimensional Matrices

This work proposes 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.

An Introduction to CORA 2015

Time-Triggered Conversion of Guards for Reachability Analysis of Hybrid Automata

This work shows that it is often possible to remove the need to perform high-dimensional geometric operations by combining two model transformations, direct time-triggered conversion and dynamics scaling, and proves the overapproximation error in the conversion can be made arbitrarily small.

HyPro: A C++ Library of State Set Representations for Hybrid Systems Reachability Analysis

HyPro, the authors' free and open-source C++ programming library, is introduced, which offers implementations for the most prominent state set representations used by flowpipe-construction-based reachability analysis techniques for hybrid systems.

Lectures on Polytopes

Based on a graduate course given at the Technische Universitat, Berlin, these lectures present a wealth of material on the modern theory of convex polytopes. The clear and straightforward