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 …

Recently, contract-based design has been proposed as an “orthogonal” approach that
complements system design methodologies proposed so far to cope with the complexity of …

Uppaal Stratego is a novel tool which facilitates generation, optimization, comparison as
well as consequence and performance exploration of strategies for stochastic priced timed …

In 2005 we proposed the first efficient on-the-fly algorithm for solving games based on timed
game automata with respect to reachability and safety properties. The first prototype …

This chapter surveys timed automata as a formalism for model checking real-time systems.
We begin with introducing the model, as an extension of finite-state automata with real …

A specification theory combines notions of specifications and implementations with a
satisfaction relation, a refinement relation and a set of operators supporting stepwise design …

We present Acacia+, a tool for solving the LTL realizability and synthesis problems. We use
recent approaches that reduce these problems to safety games, and can be solved …

Distributed applications running inside cloud systems are prone to performance anomalies
due to various reasons such as resource contentions, software bugs, and hardware failures …

In this paper, we present new monolithic and compositional algorithms to solve the LTL
realizability problem. Those new algorithms are based on a reduction of the LTL realizability …

Uppaal is a tool suitable for model checking real‐time systems described as networks of
timed automata communicating by channel synchronizations and extended with integer …