Quantitative verification tools compute probabilities, expected rewards, or steady-state
values for formal models of stochastic and timed systems. Exact results often cannot be …

The size and complexity of control software in aerospace systems is rapidly increasing, and
this development complicates its validation within the context of the overall spacecraft …

Markov decision processes (MDPs) and continuous-time MDP (CTMDPs) are the
fundamental models for non-deterministic systems with probabilistic uncertainty. Mean …

Lightweight scheduler sampling brings statistical model checking to nondeterministic
formalisms with undiscounted properties, in constant memory. Its direct application to …

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 …

Markov automata (MAs) extend labelled transition systems with random delays and
probabilistic branching. Action-labelled transitions are instantaneous and yield a distribution …

Distributed systems exhibit probabilistic and non-deterministic behaviors and may have time
constraints. Probabilistic Timed Rebeca (PTRebeca) is introduced as a timed and …

In the context of Markov decision processes running in continuous time, one of the most
intriguing challenges is the efficient approximation of finite horizon reachability objectives. A …

This paper presents a new state space generation approach for dynamic fault trees (DFTs)
together with a technique to synthesise allowed failures rates in DFTs. Our state space …

Quantitative model checking and performance evaluation deal with the analysis of complex
systems that must not only satisfy correctness requirements, but also meet performance and …