文章基本信息

标题：Simple Priced Timed Games are not That Simple
本地全文：下载
作者：Thomas Brihaye ; Gilles Geeraerts ; Axel Haddad 等
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2015
卷号：45
页码：278-292
DOI：10.4230/LIPIcs.FSTTCS.2015.278
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：Priced timed games are two-player zero-sum games played on priced timed automata (whose locations and transitions are labeled by weights modeling the costs of spending time in a state and executing an action, respectively). The goals of the players are to minimise and maximise the cost to reach a target location, respectively. We consider priced timed games with one clock and arbitrary (positive and negative) weights and show that, for an important subclass of theirs (the so-called simple priced timed games), one can compute, in exponential time, the optimal values that the players can achieve, with their associated optimal strategies. As side results, we also show that one-clock priced timed games are determined and that we can use our result on simple priced timed games to solve the more general class of so-called reset-acyclic priced timed games (with arbitrary weights and one-clock).
关键词：Priced timed games; real-time systems; game theory