文章基本信息

标题：The Complexity of Rational Synthesis
本地全文：下载
作者：Rodica Condurache ; Emmanuel Filiot ; Raffaella Gentilini 等
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2016
卷号：55
页码：121:1-121:15
DOI：10.4230/LIPIcs.ICALP.2016.121
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：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.
关键词：Non-zero sum games; reactive synthesis; omega-regular objectives