Randomization is a key element in sequential and distributed computing. Reasoning about
randomized algorithms is highly non-trivial. In the 1980s, this initiated first proof methods …

This paper reviews the model of interactive Markov chains (IMCs, for short), an extension of
labelled transition systems with exponentially delayed transitions. We show that IMCs are …

In this article, we propose a compositional framework for the synthesis of safety controllers
for networks of partially observable discrete-time stochastic control systems (also known as …

We discuss conceptional and foundational aspects of Markov automata [22]. We place this
model in the context of continuous-and discrete-time Markov chains, probabilistic automata …

Abstract Probabilistic Automata (PAs) are a widely-recognized mathematical framework for
the specification and analysis of systems with non-deterministic and stochastic behaviors …

Notions of specification, implementation, satisfaction, and refinement, together with
operators supporting stepwise design, constitute a specification theory. We construct such a …

We study recursive timed automata that extend timed automata with recursion. Timed
automata, as introduced by Alur and Dill, are finite automata accompanied by a finite set of …

Notions of specification, implementation, satisfaction, and refinement, together with
operators supporting stepwise design, constitute a specification theory. We construct such a …

Formal methods initially focused on the mathematically precise specification, design and
analysis of functional aspects of software and hardware systems. In this context, model …

Abstract Interval Markov Chains (IMCs) are the base of a classic probabilistic specification
theory by Larsen and Jonsson in 1991. They are also a popular abstraction for probabilistic …