Uppaal-Tiga: Timed Games for Everyone

nordic workshop programming theory(2009)

引用 25|浏览55
暂无评分
摘要
In 2005 we proposed the first efficient on-the-fly algorithm for solving games based on timed game automata with respect to reachabil- ity 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 (com- plete support of all the language features of Uppaal). In addition, the tool supports the new feature of strategy generation with different com- pactness levels. In this paper we present this new version of Uppaal- Tiga.
更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要