dReach: δ-Reachability Analysis for Hybrid Systems

@inproceedings{Kong2015dReachA,
  title={dReach: $\delta$-Reachability Analysis for Hybrid Systems},
  author={Soonho Kong and Sicun Gao and Wei Chen and Edmund M. Clarke},
  booktitle={International Conference on Tools and Algorithms for Construction and Analysis of Systems},
  year={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 delta-decision procedures in the SMT solver dReach. In this way, dReach is able to handle a wide range of highly nonlinear hybrid systems. It has scaled well on various realistic models from biomedical and robotics applications. 
View via Publisher
cs.cmu.edu
251 Citations
Highly Influential Citations
11
Background Citations
74
Methods Citations
109
Results Citations
2

251 Citations

Unbounded-time reachability analysis of hybrid systems by abstract acceleration

  • P. Schrammel
  • Computer Science
    2015 International Conference on Embedded Software (EMSOFT)
  • 2015
Linear dynamical systems are ubiquitous in hybrid systems, both as physical models or as software control modules. Therefore we need an unbounded-time reachability analysis that can cope with…

Reachability Analysis for Cyber-Physical Systems: Are We There Yet?

. Reachability analysis is a fundamental problem in verification that checks for a given model and set of initial states if the system will reach a given set of unsafe states. Its importance lies in…

ProbReach: A Tool for Guaranteed Reachability Analysis of Stochastic Hybrid Systems

An overview of ProbReach, a tool for computing probabilistic reachability in SHS which was introduced in [18], and an overview of the recent theoretical extensions and modification of the tool.

Reachability of Black-Box Nonlinear Systems after Koopman Operator Linearization

DryVR: Data-Driven Verification and Compositional Reasoning for Automotive Systems

The DryVR framework is presented, which includes a probabilistic algorithm for learning sensitivity of the continuous trajectories from simulation data, a bounded reachability analysis algorithm that uses the learned sensitivity, and reasoning techniques based on simulation relations and sequential composition that enable verification of complex systems under long switching sequences.

Simulation-Based Reachability Analysis for High-Index Large Linear Differential Algebraic Equations

The recent scalable simulation-based reachability analysis in combination with decoupling techniques for a class of high-index large linear DAEs is extended and sucessfully verifies a wide range of practical, high- indexlinear DAE systems in which the number of state variables varies from several to thousands.

Verification for Continuous and Hybrid Systems SMT-Based CPS Parameter Synthesis ∗ ( Tool Presentation )

We present a simple, yet flexible parameter synthesis approach for Cyber-Physical Systems (CPS). The user defines the behavior of a CPS, a set of (un)safe states, and a generic template for an…

Applied veRification for Continuous and Hybrid Systems SMT Encoding of Hybrid Systems in dReal ∗

A novel SMT syntax of dReal enables to effectively represent networks of hybrid systems in a modular way and illustrates SMT encoding in dReal with simple nonlinear hybrid systems.

Automatic Reachability Analysis for Nonlinear Hybrid Models with C2E2

This version of C2E2 is improved in several ways, the most prominent among which is the elimination of the need for user-provided discrepancy functions, which makes it a usable tool for bounded reachability analysis of hybrid systems.

Decomposed Reachability Analysis for Nonlinear Systems

An approach to conservatively abstract a nonlinear continuous system by a hybrid automaton whose continuous dynamics are given by a decomposition of the original dynamics, in the form of a set of lower-dimensional ODEs with time-varying uncertainties whose ranges are defined by the hybridization domains.
...

References

SHOWING 1-10 OF 17 REFERENCES

Delta-Complete Analysis for Bounded Reachability of Hybrid Systems

The framework of delta-complete analysis for bounded reachability problems of general hybrid systems is presented and it is proved that the verification problems become much more mathematically tractable in this new framework.

Reachability Analysis of Nonlinear Differential-Algebraic Systems

The procedure computes reachable sets for uncertain initial states and inputs in an overapproximative way, i.e. it is guaranteed that all possible trajectories of the system are enclosed, and can be used for formal verification of system properties that can be specified in the state space as unsafe or goal regions.

SpaceEx: Scalable Verification of Hybrid Systems

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…

Satisfiability modulo ODEs

δ-complete algorithms for SMT formulas that are purely existentially quantified, as well as ∃∀-formulas whose universal quantification is restricted to the time variables are developed.

Analysis of Hybrid Systems Using HySAT

In this paper we describe the complete workflow of analyzing the dynamic behavior of safety-critical embedded systems with HySAT. HySAT is an arithmetic constraint solver with a tightly integrated…

Engineering constraint solvers for automatic analysis of probabilistic hybrid automata

Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems

This work presents two semidecision procedures for verifying safety properties of piecewiselinear hybrid automata, in which all variables change at constant rates, and demonstrates that for many of the typical workshop examples, the procedures do terminate and thus provide an automatic way for verifying their properties.

Parameter Identification Using δ-Decisions for Biological Hybrid Systems

This work presents a parameter identification framework for biological hybrid systems using δ-complete decision procedures, which can solve satisfiability modulo theories (SMT) problems over the reals with a wide range of nonlinear functions, including ordinary differential equations (ODEs).

SMT-Based Verification of Hybrid Systems

This paper surveys the recent advances in the application of Satisfiability Modulo Theories (SMT) to the analysis of hybrid automata networks.

Verifying robust frequency domain properties of non linear oscillators using SMT

  • H. AsadK. JonesF. Surre
  • Computer Science, Mathematics
    17th International Symposium on Design and Diagnostics of Electronic Circuits & Systems
  • 2014
This work uses SAT modulo ODE for Bounded Model Checking (BMC) of the non-linear hybrid automata and shows that the oscillator hybrid timed traces satisfy frequency domain specifications.