UPPAAL TIGA (Fig. 1) is an extension of UPPAAL [BDL04] and it implements the first efficient on-the-fly algorithm for solving games based on timed game automata with respect to reachability and safety properties. Though timed games for long have been known to be decidable there has until now been a lack of efficient and truly on-the-fly algorithms for their analysis. The algorithm we propose [CDFLL05] is a symbolic extension of the on-the-fly algorithm suggested by Liu & Smolka [LS98] for linear-time model-checking of finite-state systems. Being on-the-fly, the symbolic algorithm may terminate long before having explored the entire state-space. Also the individual steps of the algorithm are carried out efficiently by the use of so-called zones as the underlying data structure. Our tool implements various optimizations of the basic symbolic algorithm, as well as methods for obtaining time-optimal winning strategies (for reachability games).
Keywords for this software
References in zbMATH (referenced in 45 articles )
Showing results 41 to 45 of 45.
- Cassez, Franck; Jessen, Jan J.; Larsen, Kim G.; Raskin, Jean-François; Reynier, Pierre-Alain: Automatic synthesis of robust and optimal controllers -- an industrial case study (2009)
- Srba, Jiří: Comparing the expressiveness of timed automata and timed extensions of Petri nets (2008)
- Behrmann, Gerd; Cougnard, Agnès; David, Alexandre; Fleury, Emmanuel; Larsen, Kim G.; Lime, Didier: UPPAAL-Tiga: Time for playing games! (2007) ioport
- Cassez, Franck: Efficient on-the-fly algorithms for partially observable timed games (2007)
- Cassez, Franck; David, Alexandre; Larsen, Kim G.; Lime, Didier; Raskin, Jean-François: Timed control with observation based and stuttering invariant strategies (2007)