The design and control of autonomous systems that operate in uncertain or adversarial
environments can be facilitated by formal modeling and analysis. Probabilistic model …

Probabilistic model checking is a powerful technique for formally verifying quantitative
properties of systems that exhibit stochastic behaviour. Such systems are found in many …

Service-based systems that are dynamically composed at runtime to provide complex,
adaptive functionality are currently one of the main development paradigms in software …

Probabilistic verification techniques are a powerful means to ensure that a software-
intensive system fulfills its quality requirements. To apply these techniques an accurate …

Probabilistic timed automata (PTAs) are a formalism for modelling systems whose behaviour
incorporates both probabilistic and real-time characteristics. Applications include wireless …

This paper presents a new language for network programming based on a probabilistic
semantics. We extend the NetKATlanguage with new primitives for expressing probabilistic …

We study the logic of dynamical systems, that is, logics and proof principles for properties of
dynamical systems. Dynamical systems are mathematical models describing how the state …

Automated verification is a technique for establishing if certain properties, usually expressed
in temporal logic, hold for a system model. The model can be defined using a high-level …

Probabilistic model checking is a powerful technique for formally verifying quantitative
properties of systems that exhibit stochastic behaviour. Such systems are found in many …

The analysis of formal models that include quantitative aspects such as timing or
probabilistic choices is performed by quantitative verification tools. Broad and mature tool …