License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CONCUR.2015.311
URN: urn:nbn:de:0030-drops-53863
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2015/5386/
Go to the corresponding LIPIcs Volume Portal

Bouyer, Patricia ; Jaziri, Samy ; Markey, Nicolas

On the Value Problem in Weighted Timed Games

pdf-format:
26.pdf (0.5 MB)

Abstract

A weighted timed game is a timed game with extra quantitative information representing e.g. energy consumption. Optimizing the weight for reaching a target is a natural question, which has already been investigated for ten years. Existence of optimal strategies is known to be undecidable in general, and only very restricted classes of games have been identified for which optimal weight and almost-optimal strategies can be computed. In this paper, we show that the value problem is undecidable in weighted timed games. We then introduce a large subclass of weighted timed games (for which the undecidability proof above applies), and provide an algorithm to compute arbitrary approximations of the value in such games. To the best of our knowledge, this is the first approximation scheme for an undecidable class of weighted timed games.

BibTeX - Entry

@InProceedings{bouyer_et_al:LIPIcs:2015:5386,
  author =	{Patricia Bouyer and Samy Jaziri and Nicolas Markey},
  title =	{{On the Value Problem in Weighted Timed Games}},
  booktitle =	{26th International Conference on Concurrency Theory (CONCUR 2015)},
  pages =	{311--324},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-91-0},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{42},
  editor =	{Luca Aceto and David de Frutos Escrig},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2015/5386},
  URN =		{urn:nbn:de:0030-drops-53863},
  doi =		{10.4230/LIPIcs.CONCUR.2015.311},
  annote =	{Keywords: Timed games, undecidability, approximation}
}

Keywords: Timed games, undecidability, approximation
Collection: 26th International Conference on Concurrency Theory (CONCUR 2015)
Issue Date: 2015
Date of publication: 26.08.2015

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI