Time: Wednesday 16.2.2005, 14:30
Place: Room A4-106, Fr. Bajersvej 7
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 simple winning conditions (while the analogous problem under complete observability is decidable). We also identify a decidable subclass. To better understand why partial observability makes control problems much more difficult we finally discuss some issues in observation of timed systems.