Stochastic hybrid automata (SHA) are a powerful tool to evaluate the dependability and
safety of critical infrastructures. However, the resolution of nondeterminism, which is present …

This paper proposes an algorithm to maximize reachability probabilities for rectangular
automata with random clocks via a history-dependent prophetic scheduler. This model class …

Over the last decades, the development of algorithms and tools for the safety verification of
hybrid systems has been content of intensive research. Numerous novel ideas have been …

We apply reinforcement learning to approximate the optimal probability that a stochastic
hybrid system satisfies a temporal logic formula. We consider systems with (non) linear …

Different stochastic extensions of hybrid automata have been proposed in the past, with
unclear expressivity relations between them. To structure and relate these modeling …

This paper introduces two stochastic variants of rectangular automata. First, rectangular
automata with random events (RAE) are introduced, which semantically embed random …

Efficient reachability analysis, as well as statistical model checking have been proposed for
the evaluation of Hybrid Petri nets with general transitions (HPnG). Both have different (dis-) …

This paper presents the open-source C++ tool RealySt for effectively computing optimal time-
bounded reachability probabilities for subclasses of hybrid automata extended with random …

Efficient reachability analysis, as well as statistical model checking have been proposed for
the evaluation of Hybrid Petri nets with general transitions (HPnGs). Both have different (dis …

This report is concerned with a friendly competition for formal verification and policy
synthesis of stochastic models. The main goal of the report is to introduce new benchmarks …