UPPAAL-Tiga: Timed Games for Everyone

Alexandre David, Kim Guldstrand Larsen, Gerd Behrmann, Emmanuel Fleury, Didier Lime, Agnès Cougnard

Research output: Contribution to book/anthology/report/conference proceedingConference abstract in proceedingResearch

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.
Original languageEnglish
Title of host publicationProceedings of the 18th Nordic Workshop on Programming Theory
EditorsLuca Aceto, Anna Ingolfdottir
Number of pages4
PublisherUniversity of Reykjavik
Publication date2006
Publication statusPublished - 2006
Event18th Nordic Workshop on Programming Theory (NWPT'06) - Reykjavik, Iceland
Duration: 18 Oct 200620 Oct 2006

Conference

Conference18th Nordic Workshop on Programming Theory (NWPT'06)
Country/TerritoryIceland
CityReykjavik
Period18/10/200620/10/2006

Keywords

  • timed-automata
  • timed games
  • model-checker
  • UPPAAL

Fingerprint

Dive into the research topics of 'UPPAAL-Tiga: Timed Games for Everyone'. Together they form a unique fingerprint.

Cite this