下推安全对策中的最优弹性策略
Optimally Resilient Strategies in Pushdown Safety Games
摘要：
带有干扰的无限持续时间博弈扩展了无限持续时间博弈的经典框架，该框架捕获了反应性合成问题，并对非对抗性外部影响进行了离散的弹性测量。这涉及观察到的系统行为与控制器规定的预期行为不同的事件。对于在有限竞技场上进行的游戏，已知计算最优弹性策略只会比求解经典游戏产生多项式开销。研究了由下推系统诱导的具有扰动的无限域上的安全对策。我们展示了如何计算最优弹性策略在三次指数时间。对于一个计数器配置图上玩的安全游戏的子类，我们表明，确定初始配置的弹性程度是PSPACE-完全的，并且最佳弹性策略可以在双指数时间内计算。
英文摘要：
Infinite-duration games with disturbances extend the classical framework of infinite-duration games, which captures the reactive synthesis problem, with a discrete measure of resilience against non-antagonistic external influence. This concerns events where the observed system behavior differs from the intended one prescribed by the controller. For games played on finite arenas it is known that computing optimally resilient strategies only incurs a polynomial overhead over solving classical games. This paper studies safety games with disturbances played on infinite arenas induced by pushdown systems. We show how to compute optimally resilient strategies in triply-exponential time. For the subclass of safety games played on one-counter configuration graphs, we show that determining the degree of resilience of the initial configuration is PSPACE-complete and that optimally resilient strategies can be computed in doubly-exponential time.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
