SReach: A Probabilistic Bounded Delta-Reachability Analyzer for Stochastic Hybrid Systems

@inproceedings{Wang2015SReachAP,
  title={SReach: A Probabilistic Bounded Delta-Reachability Analyzer for Stochastic Hybrid Systems},
  author={Qinsi Wang and Paolo Zuliani and Soonho Kong and Sicun Gao and Edmund M. Clarke},
  booktitle={CMSB},
  year={2015}
}
In this paper, we present a new tool SReach, which solves probabilistic bounded reachability problems for two classes of models of stochastic hybrid systems. The first one is (nonlinear) hybrid automata with parametric uncertainty. The second one is probabilistic hybrid automata with additional randomness for both transition probabilities and variable resets. Standard approaches to reachability problems for linear hybrid systems require numerical solutions for large optimization problems, and… 
Counterexample Guided Abstraction Refinement for Polyhedral Probabilistic Hybrid Systems
TLDR
This work presents a novel counterexample guided abstraction refinement (CEGAR) algorithm for a subclass of probabilistic hybrid systems, called polyhedral probabilism hybrid systems (PHS), where the continuous dynamics is specified using a polyhedral set within which the derivatives of the continuous executions lie.
Probabilistic Hybrid Systems Verification via SMT and Monte Carlo Techniques
TLDR
This paper introduces a Monte Carlo-SMT approach for computing probabilistic reachability confidence intervals that are both statistically and numerically rigorous and applies it to hybrid systems involving nonlinear differential equations.
Hierarchical Abstractions for Reachability Analysis of Probabilistic Hybrid Systems
  • Ratan Lal, P. Prabhakar
  • Computer Science
    2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
  • 2018
TLDR
This work focuses on linear dynamics and proposes a two tier abstraction for computing bounds on the probability of reachability, wherein the first step performs dynamics simplification by applying hybridization such that the resulting dynamics is a polyhedral inclusion and the second step constructs a finite state markov decision process that abstracts thepolyhedral inclusion dynamics.
Probabilistic Safety Verification of Stochastic Hybrid Systems Using Barrier Certificates
TLDR
A new barrier certificate based method is proposed which guarantees the absolute safety in a infinite time horizon that is beyond the reach of existing techniques using either statistical model checking or probabilistic reachable set computation.
Bounded Verification of Reachability of Probabilistic Hybrid Systems
TLDR
This paper focuses on polyhedral dynamical systems to model continuous dynamics and computation of the exact minimum/maximum probability of reachability within k discrete steps in a polyhedral probabilistic hybrid system.
Automated Verification and Synthesis of Stochastic Hybrid Systems: A Survey
TLDR
This survey overviews the most recent results in the literature and discusses different approaches, including (in)finite abstractions, verification and synthesis for temporal logic specifications, stochastic similarity relations, (control) barrier certificates, compositional techniques, and a selection of results on continuous-time Stochastic hybrid systems.
GoTube: Scalable Stochastic Verification of Continuous-Depth Models
TLDR
This work introduces a new stochastic verification algorithm that formally quantifies the behavioral robustness of any timecontinuous process formulated as a continuous-depth model and calls it GoTube, which is stable and sets the state of the art in terms of its ability to scale to time horizons well beyond what has been previously possible.
AMYTISS: Parallelized Automated Controller Synthesis for Large-Scale Stochastic Systems
TLDR
This paper proposes a software tool, called AMYTISS, implemented in C++/OpenCL, for designing correct-by-construction controllers for large-scale discrete-time stochastic systems and applies it to a 3-dimensional autonomous vehicle and 7-dimensional nonlinear model of a BMW 320i car by synthesizing an autonomous parking controller.
Probabilistic reachability analysis of the tap withdrawal circuit in caenorhabditis elegans
TLDR
A probabilistic reachability analysis of a (nonlinear ODE) model of a neural circuit in Caeorhabditis elegans, the common roundworm, considers Tap Withdrawal (TW), a reflexive behavior exhibited by a C. elegans worm in response to vibrating the surface on which it is moving.
Automated Verification and Control of Large-Scale Stochastic Cyber-Physical Systems: Compositional Techniques
This dissertation provides novel compositional techniques to analyze and control large-scale stochastic CPSs in an automated as well as formal fashion with three different compositional techniques
...
...

References

SHOWING 1-10 OF 30 REFERENCES
ProbReach: verified probabilistic delta-reachability for stochastic hybrid systems
TLDR
The capabilities of ProbReach are introduced, a probabilistic version of delta-reachability that is suited for hybrid systems whose stochastic behaviour is given in terms of random initial conditions is implemented, and results for several benchmarks involving highly non-linear hybrid systems are presented.
Statistical model checking for stochastic hybrid systems involving nondeterminism over continuous domains
TLDR
The non-determinism is resolved by translating the satisfaction problem into an optimization problem, thereby computing both optimistic and pessimistic bounds on the probability of satisfaction for the overall SSMT formula.
Stochastic Satisfiability Modulo Theory: A Novel Technique for the Analysis of Probabilistic Hybrid Systems
TLDR
Stochastic SMT permits the direct and fully symbolic analysis of Probabilistic bounded reachability problems of probabilistic hybrid automata without resorting to approximation by intermediate finite-state abstractions.
Bayesian statistical model checking with application to Stateflow/Simulink verification
TLDR
It is proved that Bayesian SMC can make the probability of giving a wrong answer arbitrarily small, which is essential for scaling up to large Stateflow/Simulink models.
Measurability and safety verification for stochastic hybrid systems
TLDR
Stochastic hybrid systems where the continuous-time behaviour is given by differential equations, as for usual hybrid systems, but the targets of discrete jumps are chosen by probability distributions are considered, and it is shown that measurability of a complete system follows from the measURability of its constituent parts.
Model Checking for Probabilistic Timed Systems
  • J. Sproston
  • Computer Science
    Validation of Stochastic Systems
  • 2004
TLDR
Analysis of formally probabilistic timed systems using the technique of model checking, in which it is verified automatically whether a system satisfies a certain desired property, is considered.
Verification and planning for stochastic processes with asynchronous events
TLDR
It is demonstrated that the introduction of phases permits us to take history into account when making action choices, and this can result in policies of higher quality than the authors would get if they ignored history dependence.
Delta-Complete Analysis for Bounded Reachability of Hybrid Systems
TLDR
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.
Game-based Abstraction and Controller Synthesis for Probabilistic Hybrid Systems
TLDR
This work proposes and compares two abstraction techniques for a class of hybrid systems that involve random phenomena, in addition to discrete and continuous behaviour, which yield lower and upper bounds on the optimal probability of reaching a particular class of states.
SMT-Based Bounded Model Checking for Embedded ANSI-C Software
TLDR
This work proposes the application of different background theories and SMT solvers to the verification of embedded software written in ANSI-C in order to improve scalability and precision in a completely automatic way and shows that the ESBMC model checker can analyze larger problems than existing tools and substantially reduce the verification time.
...
...