首页    期刊浏览 2024年11月05日 星期二
登录注册

文章基本信息

  • 标题:Admissibility in Quantitative Graph Games
  • 本地全文:下载
  • 作者:Romain Brenguier ; Guillermo A. P{\'e}rez ; Jean-Francois Raskin
  • 期刊名称:LIPIcs : Leibniz International Proceedings in Informatics
  • 电子版ISSN:1868-8969
  • 出版年度:2016
  • 卷号:65
  • 页码:42:1-42:14
  • DOI:10.4230/LIPIcs.FSTTCS.2016.42
  • 出版社:Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
  • 摘要:Admissibility has been studied for games of infinite duration with Boolean objectives. We extend here this study to games of infinite duration with quantitative objectives. First, we show that, under the assumption that optimal worst-case and cooperative strategies exist, admissible strategies are guaranteed to exist. Second, we give a characterization of admissible strategies using the notion of adversarial and cooperative values of a history, and we characterize the set of outcomes that are compatible with admissible strategies. Finally, we show how these characterizations can be used to design algorithms to decide relevant verification and synthesis problems.
  • 关键词:Quantitative games; Verification; Reactive synthesis; Admissibility
国家哲学社会科学文献中心版权所有