×

Efficient on-the-fly algorithms for partially observable timed games. (English) Zbl 1141.93377

Raskin, Jean-François (ed.) et al., Formal modeling and analysis of timed systems. 5th international conference, FORMATS 2007, Salzburg, Austria, October 3–5, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-75453-4/pbk). Lecture Notes in Computer Science 4763, 5-24 (2007).
Summary: In this paper, we review some recent results on the efficient synthesis of controllers for timed systems. We first recall the basics of controller synthesis for timed games and then present an efficient on-the-fly algorithm for reachability games and its extension to partially observable timed games.
The material of this paper is based on two recent articles [F. Cassez, A. David, E. Fleury, K. G. Larsen and D. Lime, “Efficient on-the-fly algorithms for the analysis of timed games”, Lect. Notes Comput. Sci. 3653, 66–80 (2005; Zbl 1134.68382); F. Cassez, A. David, K. G. Larsen, D. Lime and J.-F. Raskin, “Timed control with observation based and stuttering invariant strategies”, Lect. Notes Comput. Sci. 4762, 192–206 (2007; Zbl 1141.68428)] that introduced truly on-the-fly algorithms for the synthesis of controllers for timed games. These results were obtained together with Alexandre David, Emmanuel Fleury and Kim G. Larsen (Aalborg University, Denmark), Didier Lime (IRCCyN, France) and Jean-François Raskin (ULB, Brussels, Belgium).
For the entire collection see [Zbl 1138.68007].

MSC:

93C65 Discrete event control/observation systems
68Q45 Formal languages and automata
91A80 Applications of game theory

Software:

Kronos; UPPAAL TIGA; CMC