Attack trees are a well established and commonly used framework for security modeling.
They provide a readable and structured representation of possible attacks against a system …

Interactive, distributed, and embedded systems often behave stochastically, for example,
when inputs, message delays, or failures conform to a probability distribution. However …

Timed automata are a common formalism for the verification of concurrent systems subject to
timing constraints. They extend finite-state automata with clocks, that constrain the system …

Probabilities, real-time behaviour and continuous dynamics are the key ingredients of
quantitative models enabling formal studies of non-functional properties such as …

The formal analysis of critical systems is supported by a vast space of modelling formalisms
and tools. The variety of incompatible formats and tools however poses a significant …

The model-checking approach was originally formulated for verifying qualitative properties
of systems, for example safety and liveness (see Chap. 2), and subsequently extended to …

The theory of hybrid systems is well-established as a model for real-world systems
consisting of continuous behaviour and discrete control. In practice, the behaviour of such …

We present an extensive collection of quantitative models to facilitate the development,
comparison, and benchmarking of new verification algorithms and tools. All models have a …

This paper offers a natural stochastic semantics of Networks of Priced Timed Automata
(NPTA) based on races between components. The semantics provides the basis for …

We propose the first tool for solving complex (some undecidable) problems of timed systems
by using Statistical Model Checking (SMC). The tool monitors several runs of the system …