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 …

This paper describes a major new release of the PRISM probabilistic model checker,
adding, in particular, quantitative verification of (priced) probabilistic timed automata. These …

This tutorial presents an overview of model checking for both discrete and continuous-time
Markov chains (DTMCs and CTMCs). Model checking algorithms are given for verifying …

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

Preventing and controlling outbreaks of infectious diseases such as pandemic influenza is a
top public health priority. We describe EpiSimdemics-a scalable parallel algorithm to …

Virtual machines provide flexible, powerful execution environments for Grid computing,
offering isolation and security mechanisms complementary to operating systems …

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, a variant of timed automata extended with discrete probability
distributions, is a modelling formalism suitable for describing formally both nondeterministic …

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