We consider automata with counters whose values are updated according to signals sent by
the environment. A transition can be fired only if the values of the counters satisfy some …

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 …

Efficient automatic model-checking algorithms for real-time systems have been obtained in
recent years based on the state-region graph technique of Alur, Courcoubetis and Dill …

We present a new application of the abstract interpretation by means of convex polyhedra, to
a class of hybrid systems, ie, systems involving both discrete and continuous variables. The …

A formal and automatic verification of a real-life protocol is presented. The protocol, about
2800 lines of assembler code, has been used in products from the audio/video company …

Timed automata are among the most widely studied models for real-time systems. Silent
transitions, ie, ϵ-transitions, have already been proposed in the original paper on timed …

We present an extension of the model checker Uppaal, capable of synthesizing linear
parameter constraints for the correctness of parametric timed automata. A symbolic …

This is a tutorial paper on the tool Uppaal. Its goal is to be a short introduction on the flavour
of timed automata implemented in the tool, to present its interface, and to explain how to use …

Using elementary rigorous methods we prove the existence of a clustered phase in the
random K-SAT problem, for K≥ 8. In this phase the solutions are grouped into clusters …

In this paper, an algebra of timed processes with real-valued clocks is presented, which
serves as a formal description language for real-time communicating systems. We show that …