In contrast to the usual understanding of probabilistic systems as stochastic processes,
recently these systems have also been regarded as transformers of probabilities. In this …

Costs and rewards are important ingredients for many types of systems, modelling critical
aspects like energy consumption, task completion, repair costs, and memory usage. This …

Stochastic automata are a formal compositional model for concurrent stochastic timed
systems, with general distributions and nondeterministic choices. Measures of interest are …

Quantitative model checking is concerned with the verification of both quantitative and
qualitative properties over models incorporating quantitative information. Increases in …

Markov automata (MAs) have been introduced in [16] as a continuous-time version of
Segala's probabilistic automata (PAs)[29]. This paper defines several variants of trace …

This paper presents a model-based testing framework for black-box probabilistic systems
with stochastic continuous time. Markov automata are used as an underlying model. We …

This paper studies the linear time-branching time spectrum of equivalences for a subclass of
interactive Markov chains (IMCs) that are not subject to any further synchronization. This …

Costs and rewards are important ingredients for many types of systems, modelling critical
aspects like energy consumption, task completion, repair costs, and memory usage. This …

We present essential concepts of a model-based testing framework for probabilistic systems
with continuous time. Markov automata are used as an underlying model. Key result of the …

Stutter equivalences are important for system synthesis as well as system analysis. In this
paper, we study stutter trace equivalences for Markov automata (MAs) and how they relate to …