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 only a partial observation of the system that it controls. In discrete event systems (where continuous time is not modeled), it is well known how to handle partial observability, and decidability issues do not differ from the complete information setting. We show however that timed control under partial observability is undecidable even for internal specifications (while the analogous problem under complete observability is decidable) and we identify a decidable subclass
AbstractWe investigate extensions of Alur and Dill's timed automata, based on the possibility to upd...
. In this work we tackle the following problem: given a timed automaton, and a target set F of confi...
<p align="justify">Computer Science is currently facing a grand challenge :finding good design pract...
commonly accepted control theory for discrete event systems, due to Ramadge and Wonham [13], followe...
Abstract. We revisit the synthesis of timed controllers with partial observability. Bouyer et al. sh...
We propose automated techniques for the verification and control of probabilistic real-time systems ...
We propose automated techniques for the verification and control of probabilistic real-time systems ...
We study supervisory control of timed discrete-event systems (TDES) under partial observation, and p...
Timed automata are known not to be complementable or determinizable. Natural questions are, then, co...
International audienceWe consider the problem of synthesizing controllers for real-time systems wher...
Abstract. In this paper, the problem of synthesizing controllers that ensures non interference for m...
In this paper we focus on property-preserving preorders between timed game automata and their applic...
AbstractIn this paper, the problem of synthesizing controllers that ensures non interference for mul...
Abstract. We present an effective controller synthesis method for real-time systems modeled as timed...
Abstract. Using an automata-theoretic approach, we investigate the decidability of liveness properti...
AbstractWe investigate extensions of Alur and Dill's timed automata, based on the possibility to upd...
. In this work we tackle the following problem: given a timed automaton, and a target set F of confi...
<p align="justify">Computer Science is currently facing a grand challenge :finding good design pract...
commonly accepted control theory for discrete event systems, due to Ramadge and Wonham [13], followe...
Abstract. We revisit the synthesis of timed controllers with partial observability. Bouyer et al. sh...
We propose automated techniques for the verification and control of probabilistic real-time systems ...
We propose automated techniques for the verification and control of probabilistic real-time systems ...
We study supervisory control of timed discrete-event systems (TDES) under partial observation, and p...
Timed automata are known not to be complementable or determinizable. Natural questions are, then, co...
International audienceWe consider the problem of synthesizing controllers for real-time systems wher...
Abstract. In this paper, the problem of synthesizing controllers that ensures non interference for m...
In this paper we focus on property-preserving preorders between timed game automata and their applic...
AbstractIn this paper, the problem of synthesizing controllers that ensures non interference for mul...
Abstract. We present an effective controller synthesis method for real-time systems modeled as timed...
Abstract. Using an automata-theoretic approach, we investigate the decidability of liveness properti...
AbstractWe investigate extensions of Alur and Dill's timed automata, based on the possibility to upd...
. In this work we tackle the following problem: given a timed automaton, and a target set F of confi...
<p align="justify">Computer Science is currently facing a grand challenge :finding good design pract...