Scaling Up Reachability Analysis for Rectangular Automata with Random Clocks
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.
Cite
@article{arxiv.2508.19795,
title = {Scaling Up Reachability Analysis for Rectangular Automata with Random Clocks},
author = {Jonas Stübbe and Anne Remke and Erika Ábrahám},
journal= {arXiv preprint arXiv:2508.19795},
year = {2025}
}
Comments
This paper is accepted for publication (without appendix) in the proceedings of the 27th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC). The appendix was part of the submission and provides additional material which is not included in the SYNASC publication