License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2016.44
URN: urn:nbn:de:0030-drops-68797
URL: http://drops.dagstuhl.de/opus/volltexte/2016/6879/
Go to the corresponding LIPIcs Volume Portal


Guha, Shibashis ; Jurdzinski, Marcin ; Krishna, Shankara Narayanan ; Trivedi, Ashutosh

Mean-Payoff Games on Timed Automata

pdf-format:
LIPIcs-FSTTCS-2016-44.pdf (0.6 MB)


Abstract

Mean-payoff games on timed automata are played on the infinite weighted graph of configurations of priced timed automata between two players - Player Min and Player Max - by moving a token along the states of the graph to form an infinite run. The goal of Player Min is to minimize the limit average weight of the run, while the goal of the Player Max is the opposite. Brenguier, Cassez, and Raskin recently studied a variation of these games and showed that mean-payoff games are undecidable for timed automata with five or more clocks. We refine this result by proving the undecidability of mean-payoff games with three clocks. On a positive side, we show the decidability of mean-payoff games on one-clock timed automata with binary price-rates. A key contribution of this paper is the application of dynamic programming based proof techniques applied in the context of average reward optimization on an uncountable state and action space.

BibTeX - Entry

@InProceedings{guha_et_al:LIPIcs:2016:6879,
  author =	{Shibashis Guha and Marcin Jurdzinski and Shankara Narayanan Krishna and Ashutosh Trivedi},
  title =	{{Mean-Payoff Games on Timed Automata}},
  booktitle =	{36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016)},
  pages =	{44:1--44:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-027-9},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{65},
  editor =	{Akash Lal and S. Akshay and Saket Saurabh and Sandeep Sen},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2016/6879},
  URN =		{urn:nbn:de:0030-drops-68797},
  doi =		{10.4230/LIPIcs.FSTTCS.2016.44},
  annote =	{Keywords: Timed Automata, Mean-Payoff Games, Controller-Synthesis}
}

Keywords: Timed Automata, Mean-Payoff Games, Controller-Synthesis
Seminar: 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016)
Issue Date: 2016
Date of publication: 08.12.2016


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