Maximizing Reachability Probabilities in Rectangular Automata with Random Clocks
Abstract
This paper proposes an algorithm to maximize reachability probabilities for rectangular automata with random clocks via a history-dependent prophetic scheduler. This model class incorporates time-induced nondeterminism on discrete behavior and nondeterminism in the dynamic behavior. After computing reachable state sets via a forward flowpipe construction, we use backward refinement to compute maximum reachability probabilities. The feasibility of the presented approach is illustrated on a scalable model.
Cite
@article{arxiv.2304.14996,
title = {Maximizing Reachability Probabilities in Rectangular Automata with Random Clocks},
author = {Joanna Delicaris and Stefan Schupp and Erika Ábrahám and Anne Remke},
journal= {arXiv preprint arXiv:2304.14996},
year = {2023}
}
Comments
This paper is accepted for publication (without appendix) in the Proceedings of the 2023 International Symposium on Theoretical Aspects of Software Engineering (TASE). The appendix was part of the submission and provides additional material which is not included in the TASE publication