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.FSTTCS.2018.38
URN: urn:nbn:de:0030-drops-99373
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/9937/
Le Roux, Stéphane ;
Pauly, Arno ;
Randour, Mickael
Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions
Abstract
We study finite-memory (FM) determinacy in games on finite graphs, a central question for applications in controller synthesis, as FM strategies correspond to implementable controllers. We establish general conditions under which FM strategies suffice to play optimally, even in a broad multi-objective setting. We show that our framework encompasses important classes of games from the literature, and permits to go further, using a unified approach. While such an approach cannot match ad-hoc proofs with regard to tightness of memory bounds, it has two advantages: first, it gives a widely-applicable criterion for FM determinacy; second, it helps to understand the cornerstones of FM determinacy, which are often hidden but common in proofs for specific (combinations of) winning conditions.
BibTeX - Entry
@InProceedings{leroux_et_al:LIPIcs:2018:9937,
author = {St{\'e}phane Le Roux and Arno Pauly and Mickael Randour},
title = {{Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {38:1--38:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Sumit Ganguly and Paritosh Pandya},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9937},
URN = {urn:nbn:de:0030-drops-99373},
doi = {10.4230/LIPIcs.FSTTCS.2018.38},
annote = {Keywords: games on graphs, finite-memory determinacy, multiple objectives}
}
Keywords: |
|
games on graphs, finite-memory determinacy, multiple objectives |
Collection: |
|
38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018) |
Issue Date: |
|
2018 |
Date of publication: |
|
05.12.2018 |