Maximizing Reachability Probabilities in Rectangular Automata with Random Clocks
Authors:
- Joanna DelicarisJDJoanna Delicaris
- Stefan SchuppSSStefan Schupp
- Erika ÁbrahámEÁErika Ábrahám
- Anne RemkeARAnne Remke
Preprint
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.Keywords
All Related Versions
This publication has 25 references indexed in Scilit:
- Optimizing Reachability Probabilities for a Restricted Class of Stochastic Hybrid Automata via Flowpipe-Construction2021
- A Hierarchy of Scheduler Classes for Stochastic Automata2018
- HyPro: A C++ Library of State Set Representations for Hybrid Systems Reachability Analysis2017
- Transient Analysis of Networks of Stochastic Timed Automata Using Stochastic State Classes2013
- A Stochastic Approximation Method for Reachability Computations2006
- Verifying Quantitative Properties of Continuous Probabilistic Timed AutomataLecture Notes in Computer Science, 2000
- Decidable Model Checking of Probabilistic Hybrid Automata2000
- The Theory of Hybrid Automata2000
- What's Decidable about Hybrid Automata?Journal of Computer and System Sciences, 1998
- Lectures on Polytopes1995