Author manuscript, published in "Nordic Workshop on Programming Theory (NWPT'06), Reykjavik: Islande (2006)" Uppaal-Tiga: Timed Games for Everyone

Abstract. In 2005 we proposed the first efficient on-the-fly algorithm for solving games based on timed game automata with respect to reachability and safety properties. Since then we have completely re-implemented the first prototype and made dramatic improvements both in terms of performance (seve...

Full description

Bibliographic Details
Main Authors: Gerd Behrmann, Agnès Cougnard, Re David, Emmanuel Fleury, Kim G. Larsen, Didier Lime
Other Authors: The Pennsylvania State University CiteSeerX Archives
Format: Text
Language:English
Published: 2009
Subjects:
Islande
Online Access:http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.405.3127
http://hal.archives-ouvertes.fr/docs/00/35/04/70/PDF/BCDFLL-nwpt06.pdf
Description
Summary:Abstract. In 2005 we proposed the first efficient on-the-fly algorithm for solving games based on timed game automata with respect to reachability and safety properties. Since then we have completely re-implemented the first prototype and made dramatic improvements both in terms of performance (several orders of magnitude) and the input language (complete support of all the language features of Uppaal). In addition, the tool supports the new feature of strategy generation with different compactness levels. In this paper we present this new version of Uppaal-Tiga. 1

Similar Items