Maximizing Reachability Probabilities in Rectangular Automata with Random Clocks
Delicaris, Joanna; Schupp, Stefan; Ábrahám, Erika; Remke, Anne
Research article in edited proceedings (conference) | Peer reviewedAbstract
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.
Details about the publication
Publisher: David, Cristina; Sun, Meng
Book title: Theoretical Aspects of Software Engineering
Page range: 164-182
Publishing company: Springer
Place of publication: Cham
Title of series: Lecture Notes in Computer Science
Status: Published
Release year: 2023 (04/07/2023)
Language in which the publication is written: English
Conference: Theoretical Aspects of Software Engineering: 17th International Symposium (TASE 2023), Bristol, United Kingdom
ISBN: 978-3-031-35257-7
Link to the full text: https://doi.org/10.1007/978-3-031-35257-7_10
Keywords: reachability probabilities; optimizing continuous nondeterminism; stochastic hybrid systems
Authors from the University of Münster
| Delicaris, Joanna Georgia | Professorship for practical computer science (Prof. Remke) |
| Remke, Anne | Professorship for practical computer science (Prof. Remke) |