arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1702.05472cs.LOcs.AIcs.FLcs.GTmath.PR
收藏

马尔可夫决策过程中保证奇偶目标的门限约束

Threshold Constraints with Guarantees for Parity Objectives in Markov Decision Processes

ENS Rennes(雷恩高等师范学院);ULB - Université libre de Bruxelles(布鲁塞尔自由大学)

Raphaël Berthon, Mickael Randour, Jean-François Raskin

摘要:

Bruyère等人最近引入了超越最坏情况综合问题。[BFRR 14]:它旨在构建系统控制器,该控制器针对对抗性环境提供严格的最坏情况性能保证,同时确保针对环境的随机模型的更高预期性能。我们的工作扩展了[BFRR 14]和后续论文的框架,这些论文专注于定量目标,通过解决$ω$的情况-编码为奇偶目标的正则条件,一种自然的方式来表示系统的功能需求。我们建立的策略,满足所有播放的主要平价目标,同时确保有足够的概率次要的。与定量目标相比,这种设置提出了新的挑战,因为人们无法在不危及系统功能特性的情况下轻松混合不同的策略。我们建立,对于这个问题的所有变体,决定存在的战略在于${\sf NP} \cap {\sf coNP}$,相同的复杂性类的经典奇偶游戏。因此,我们的框架提供了额外的建模能力,同时保持在相同的复杂性类。[BFRR 14] Véronique Bruyère,Emmanuel Filiot,Mickael Randour和Jean-François Raskin。保证满足您的期望:超越量化游戏中的最坏情况合成。在Ernst W. Mayr和Natacha Portier,编辑,第31届计算机科学理论方面国际研讨会,STACS 2014,2014年3月5-8日,法国里昂,LIPICS第25卷,第199-213页。Schloss Dagstuhl - Leibniz - Zentrum fuer Informatik,2014.

英文摘要:

The beyond worst-case synthesis problem was introduced recently by Bruyère et al. [BFRR14]: it aims at building system controllers that provide strict worst-case performance guarantees against an antagonistic environment while ensuring higher expected performance against a stochastic model of the environment. Our work extends the framework of [BFRR14] and follow-up papers, which focused on quantitative objectives, by addressing the case of $ω$-regular conditions encoded as parity objectives, a natural way to represent functional requirements of systems. We build strategies that satisfy a main parity objective on all plays, while ensuring a secondary one with sufficient probability. This setting raises new challenges in comparison to quantitative objectives, as one cannot easily mix different strategies without endangering the functional properties of the system. We establish that, for all variants of this problem, deciding the existence of a strategy lies in ${\sf NP} \cap {\sf coNP}$, the same complexity class as classical parity games. Hence, our framework provides additional modeling power while staying in the same complexity class. [BFRR14] Véronique Bruyère, Emmanuel Filiot, Mickael Randour, and Jean-François Raskin. Meet your expectations with guarantees: Beyond worst-case synthesis in quantitative games. In Ernst W. Mayr and Natacha Portier, editors, 31st International Symposium on Theoretical Aspects of Computer Science, STACS 2014, March 5-8, 2014, Lyon, France, volume 25 of LIPIcs, pages 199-213. Schloss Dagstuhl - Leibniz - Zentrum fuer Informatik, 2014.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑