Timed Control with Partial Observability

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.

[1]  Robert McNaughton,et al.  Infinite Games Played on Finite Graphs , 1993, Ann. Pure Appl. Logic.

[2]  P. Madhusudan,et al.  Timed Control Synthesis for External Specifications , 2002, STACS.

[3]  W. Wonham,et al.  Supervisory control of timed discrete-event systems under partial observation , 1995, IEEE Trans. Autom. Control..

[4]  H. Wong-Toi,et al.  The control of dense real-time discrete event systems , 1991, [1991] Proceedings of the 30th IEEE Conference on Decision and Control.

[5]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[6]  Jim Alves-Foss,et al.  Higher Order Logic Theorem Proving and its Applications 8th International Workshop, Aspen Grove, Ut, Usa, September 11-14, 1995 : Proceedings , 1995 .

[7]  Orna Kupfermant,et al.  Synthesis with Incomplete Informatio , 2000 .

[8]  Wolfgang Thomas,et al.  Infinite Games and Verification (Extended Abstract of a Tutorial) , 2002, CAV.

[9]  Joseph Sifakis,et al.  Controller Synthesis for Timed Automata 1 , 1998 .

[10]  H. Wong-Toi,et al.  The synthesis of controllers for linear hybrid automata , 1997, Proceedings of the 36th IEEE Conference on Decision and Control.

[11]  Thomas A. Henzinger,et al.  A Comparison of Control Problems for Timed and Hybrid Systems , 2002, HSCC.

[12]  Vijay K. Garg,et al.  Modeling and Control of Logical Discrete Event Systems , 1994 .

[13]  Aniello Murano,et al.  Dense Real-Time Games , 2002, LICS.

[14]  Wolfgang Thomas,et al.  On the Synthesis of Strategies in Infinite Games , 1995, STACS.

[15]  John H. Reif,et al.  The Complexity of Two-Player Games of Incomplete Information , 1984, J. Comput. Syst. Sci..