Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICALP.2016.121
URN: urn:nbn:de:0030-drops-62565
URL: https://drops.dagstuhl.de/opus/volltexte/2016/6256/
Condurache, Rodica ; Filiot, Emmanuel ; Gentilini, Raffaella ; Raskin, Jean-François
The Complexity of Rational Synthesis
| pdf-format: |
|
Abstract
We study the computational complexity of the cooperative and non-cooperative rational synthesis problems, as introduced by Kupferman, Vardi and co-authors. We provide tight results for most of the classical omega-regular objectives, and show how to solve those problems optimally.
BibTeX - Entry
@InProceedings{condurache_et_al:LIPIcs:2016:6256,
author = {Rodica Condurache and Emmanuel Filiot and Raffaella Gentilini and Jean-Fran{\c{c}}ois Raskin},
title = {{The Complexity of Rational Synthesis}},
booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)},
pages = {121:1--121:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-013-2},
ISSN = {1868-8969},
year = {2016},
volume = {55},
editor = {Ioannis Chatzigiannakis and Michael Mitzenmacher and Yuval Rabani and Davide Sangiorgi},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6256},
URN = {urn:nbn:de:0030-drops-62565},
doi = {10.4230/LIPIcs.ICALP.2016.121},
annote = {Keywords: Non-zero sum games, reactive synthesis, omega-regular objectives}
}
| Keywords: | Non-zero sum games, reactive synthesis, omega-regular objectives | |
| Seminar: | 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016) | |
| Issue date: | 2016 | |
| Date of publication: | 23.08.2016 |
