The control of complex systems poses new challenges that fall beyond the traditional
methods of control theory. One of these challenges is given by the need to control …

Finite automata and regular languages have been useful in a wide variety of problems in
computing, communication and control, including formal modeling and verification …

Fault diagnosis consists in observing behaviours of systems, and in detecting online
whether an error has occurred or not. In the context of discrete event systems this problem …

Weighted timed automata are timed automata annotated with costs on locations and
transitions. The optimal game-reachability problem for these automata is to find the best-cost …

We consider the problem of synthesizing controllers for timed systems modeled using timed
automata. The point of departure from earlier work is that we consider controllers that have …

Timed automata are known not to be complementable or determinizable. Natural questions
are, then, could we check whether a given TA enjoys these properties? These problems are …

We explore the notion of history-determinism in the context of timed automata (TA).
Historydeterministic automata are those in which nondeterminism can be resolved on the fly …

Weighted timed automata extend timed automata with costs on both locations and
transitions. In this framework we study the optimal reachability and the optimal control …

We consider two-player games played in real time on game structures with clocks where the
objectives of players are described using parity conditions. The games are concurrent in that …

In this paper, the problem of synthesizing controllers that ensures non interference for
multilevel security dense timed discrete event systems modeled by an extension of Timed …