Enormous progress has been achieved in the last decade in the verification of timed
systems, making it possible to analyze significant real-world protocols. An open challenge is …

Abstract Model-based testing is a popular technology for automatic and systematic test case
generation (TCG), where a system-under-test (SUT) is tested for conformance with a model …

Verification of real-time systems is an important subject of research. This is highly motivated
by an increasing demand to verify safety critical systems, ie, time-dependent distributed …

Given a timed automaton M, a linear temporal logic formula φ, and a bound k, bounded
model checking for timed automata determines if there is a falsifying path of length k to the …

In the context of DPLL (T), theory propagation is the process of dynamically selecting
consequences of a conjunction of constraints from a given set of candidate constraints. We …

In this paper, we give a step by step introduction to the theory of well quasi-ordered
transition systems. The framework combines two concepts, namely (i) transition systems …

Constraint LTL over clocks is a variant of CLTL, an extension of linear-time temporal logic
allowing atomic assertions in a concrete constraint system. Satisfiability of CLTL over clocks …

Formal verification has been identified by the research community as a useful step in logic
controller design since it reveals algorithmically whether the controller in conjunction with …

A timed network is a parallel composition of timed automata synchronizing on common
actions. We develop a methodology that allows to use partial-order methods when solving …

In this paper, we consider the problem of model checking fair transition systems expressed
symbolically in the framework of Satisfiability Modulo Theories. This problem, referred to as …