Timed automata are a popular formalism to model real-time systems. They were introduced
two decades ago to support formal verification. Since then they have also been used for …

In this dissertation we report on our main research contributions dealing with Model-Based
Testing of Dynamic and Distributed Real-Time Systems, performed during the last ten years …

In this paper, we propose an abstract procedure which, given a timed automaton, produces
a language-equivalent deterministic infinite timed tree. We prove that under a certain …

Timed automata are frequently used to model real-time systems. Their determinization is a
key issue for several validation problems. However, not all timed automata can be …

This article develops a novel design principle for the observer of timed discrete event
systems behaving under specific time semantics. Observers devoted to discrete event …

Given a timed automaton \calP modeling an implementation and a timed automaton \calS as
a specification, language inclusion checking is to decide whether the language of \calP is a …

We introduce timed automata and show how they can be used for the specification of timed
systems. We also present some syntactical extensions useful for modeling and in particular …

Reinforcement Learning (RL) is a sampling based approach to optimization, where learning
agents rely on scalar reward signals to discover optimal solutions. The specification of …

Finite State Machines (FSMs) are widely used as formal models for solving numerous tasks
in software engineering, VLSI design, development of telecommunication systems, etc. To …

Partial observability and controllability are two well-known issues in test-case synthesis for
reactive systems. We address the problem of partial control in the synthesis of test cases …