Scaling Up Reachability Analysis for Rectangular Automata with Random Clocks

International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), pp. 21–29

Abstract

This paper presents optimizations to improve the scalability of reachability analysis on a subclass of hybrid automata extended with stochasticity. The optimizations target different components of the analysis, such as quantifier elimination for state set projection, and automated parameter selection during the numerical integration. Most importantly, whereas the original method combines forward and backward reachability, we show that the usage of backward reachability is optional for computing maximal reachability probabilities.

Authors 3

1. Jonas Stübbe
   Affiliation as printed

   University of Münster,Münster,Germany

2. Anne Remke
   Affiliation as printed

   University of Münster,Münster,Germany

3. Erika Ábrahám Aachen

   RWTH Aachen University

   Affiliation as printed

   RWTH Aachen University,Aachen,Germany