# Current Challenges in the Verification of Hybrid Systems

@inproceedings{Schupp2015CurrentCI, title={Current Challenges in the Verification of Hybrid Systems}, author={Stefan Schupp and Erika {\'A}brah{\'a}m and Xin Chen and Ibtissem Ben Makhlouf and Goran Frehse and Sriram Sankaranarayanan and Stefan Kowalewski}, booktitle={International Workshop on Design, Modeling and Evaluation of Cyber Physical Systems}, year={2015} }

Latest developments brought interesting theoretical results and powerful tools for the reachability analysis of hybrid systems. However, there are still challenging problems to be solved in order to make those technologies applicable to large-scale applications in industrial context. To support this development, in this paper we give a brief overview of available algorithms and tools, and point out some of their individual characteristics regarding various properties which are crucial for the…

## 33 Citations

### Comparative evaluation and improvement of computational approaches to reachability analysis of linear hybrid systems

- Computer Science
- 2016

This thesis addresses the problem of reachability analysis with the focus on linear hybrid systems using a suite of benchmarks conceived specially for this task and proposes new overapproximation techniques for treating the continuous part as well as the discrete part of the hybrid automaton.

### State set representations and their usage in the reachability analysis of hybrid systems

- Computer Science, Mathematics
- 2019

This work presents results obtained in the field of safety verification for linear hybrid systems whose continuous behavior can be described by linear differential equations, and introduces methods to decompose the search space and replace high-dimensional computations by computations in lowerdimensional subspaces.

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

- Computer ScienceFORMATS
- 2017

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.

### Spread the Work: Multi-threaded Safety Analysis for Hybrid Systems

- Mathematics, Computer ScienceSEFM
- 2018

The method computes a tree of state sets, which together over-approximate reachability by bounded-length executions, and if none of the state sets intersects with a given set of unsafe states then it is proven bounded safety.

### Efficient Parametric Verification of Parametric Timed Automata

- Computer Science
- 2018

This thesis introduces an algorithm to detect non-Zeno runs and its distributed version of it for large-scale models and introduces several smart state exploration techniques with some heuristics, in order to reduce the state space explosion.

### The present work was submitted to the LuFG Theory of Hybrid Systems

- Computer Science
- 2018

This thesis adds state rewards to DTMCs and MDPs and extends the syntax and semantics of HyperPCTL to allow reasoning about the rewards of paths in a model and modify an existing model checking algorithm to work with the modified logic.

### Verification for Continuous and Hybrid Systems Implementation of Interval Arithmetic in CORA 2016 ( Tool Presentation )

- Computer Science
- 2016

The described techniques are implemented as a class in CORA, a free MATLAB tool for continuous reachability analysis and are the only freely available implementation of interval arithmetic that runs under current MATLAB versions.

### Probably Approximate Safety Verification of Hybrid Dynamical Systems

- Computer ScienceICFEM
- 2019

A method based on linear programming that facilitates reliable safety verification of hybrid dynamical systems subject to perturbation inputs over the infinite time horizon and provides formal safety guarantees expressed using error probabilities and confidences is presented.

### Synthesis of P-Stable Abstractions

- Computer ScienceSEFM
- 2020

The representational power of P-stable abstractions are shown, that provide a high-level account of the behavior of the system with respect to stability, and the effectiveness of a compositional approach is evaluated, that allows synthesizing P- stable abstractions for significant systems.

### Revisiting Polyhedral Analysis for Hybrid Systems

- MathematicsSAS
- 2019

This paper motivates the implementation of specialized versions of several well known abstract operators, as well as the adoption of a heuristic technique for the handling of finite collections of polyhedra, showing their impact on the efficiency of the analysis tool.

## References

SHOWING 1-10 OF 38 REFERENCES

### Benchmarks for Hybrid Systems Verification

- Computer ScienceHSCC
- 2004

These are case studies that serve to prove that an approach can be applied to real world problems and require a lot of domain experience to obtain a tractable, verifiable model.

### Reachability of hybrid systems in space-time

- Computer Science2015 International Conference on Embedded Software (EMSOFT)
- 2015

This paper proposes an approach with precise control over the balance between approximation error and scalability, by lazy evaluation of set representations, which is particularly suited for clustering and containment checking, which are essential for reducing the state explosion.

### Safety Verification of Hybrid Systems by Constraint Propagation Based Abstraction Refinement

- Computer ScienceHSCC
- 2005

This paper starts from a classical method that uses interval arithmetic to check whether trajectories can move over the boundaries in a rectangular grid and improves it by developing an additional refinement step that employs constraint propagation to add information to the abstraction without introducing new grid elements.

### SpaceEx: Scalable Verification of Hybrid Systems

- Computer Science, MathematicsCAV
- 2011

We present a scalable reachability algorithm for hybrid systems with piecewise affine, non-deterministic dynamics. It combines polyhedra and support function representations of continuous sets to…

### Lecture Notes on Hybrid Systems

- Computer Science
- 2004

This course will introduce general methods for investigating properties such as existence of solutions, reachability and decidability of hybrid systems, and how discrete “discrete” entities and concepts can coexist with continuous entity and concepts, such as differential equations.

### CIF 3: Model-Based Engineering of Supervisory Controllers

- EngineeringTACAS
- 2014

This work highlights a model-based engineering framework for the engineering of supervisory controllers and explains how the CIF language and accompanying tools can be used for typical activities in that framework such as modeling, supervisory control synthesis, simulation-based validation, verification, and visualization, real-time testing, and code generation.

### Direct handling of ordinary differential equations in constraint-solving-based analysis of hybrid systems

- Computer Science, Mathematics
- 2014

This thesis allows Ordinary Differential Equations (ODEs) directly in the formula, introducing the problem class of Satisfiability (SAT) modulo ODE, and combines the iSAT-ODE solver with the VNODE-LP library for computing validated numerical enclosures for ODE solutions.

### Flow*: An Analyzer for Non-linear Hybrid Systems

- Computer ScienceCAV
- 2013

The tool Flow* performs Taylor model-based flowpipe construction for non-linear (polynomial) hybrid systems with a wide variety of optimizations including adaptive step sizes, adaptive selection of approximation orders and the heuristic selection of template directions for aggregation flowpipes.

### dReach: δ-Reachability Analysis for Hybrid Systems

- Computer ScienceTACAS
- 2015

dReach is a bounded reachability analysis tool for nonlinear hybrid systems. It encodes reachability problems of hybrid systems to first-order formulas over real numbers, which are solved by…

### KeYmaera: A Hybrid Theorem Prover for Hybrid Systems (System Description)

- Computer ScienceIJCAR
- 2008

This work integrates real quantifier elimination following an iterative background closure strategy to overcome the complexity of real arithmetic and implements a generalized free-variable sequent calculus and automatic proof strategies that decompose the hybrid system specification symbolically.