UPPAAL-Tiga: Timed Games for Everyone
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...
Main Authors: | , , , , , |
---|---|
Other Authors: | , , , , , , , |
Format: | Conference Object |
Language: | English |
Published: |
HAL CCSD
2006
|
Subjects: | |
Online Access: | https://hal.science/hal-00350470 https://hal.science/hal-00350470/document https://hal.science/hal-00350470/file/BCDFLL-nwpt06.pdf |
Summary: | 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. |
---|