最优弹性控制器的综合
Synthesizing Optimally Resilient Controllers
摘要：
最近，Dallal，Neider和Tabuada研究了程序合成中使用的经典博弈论模型的推广，该模型还考虑了未建模的间歇性干扰。在这个扩展的框架中，人们对计算最优弹性策略感兴趣，即，能够抵御尽可能多的干扰的策略。Dallal，Neider和Tabuada展示了如何计算安全规范的此类策略。在这项工作中，我们计算最佳弹性策略的更广泛的获胜条件，并表明他们不需要更多的内存比经典模型中的获胜策略。我们的算法只有一个多项式的开销相比，计算获胜的策略。特别是，对于奇偶校验条件，最优弹性策略是位置性的，并且可以在拟多项式时间内计算。
英文摘要：
Recently, Dallal, Neider, and Tabuada studied a generalization of the classical game-theoretic model used in program synthesis, which additionally accounts for unmodeled intermittent disturbances. In this extended framework, one is interested in computing optimally resilient strategies, i.e., strategies that are resilient against as many disturbances as possible. Dallal, Neider, and Tabuada showed how to compute such strategies for safety specifications. In this work, we compute optimally resilient strategies for a much wider range of winning conditions and show that they do not require more memory than winning strategies in the classical model. Our algorithms only have a polynomial overhead in comparison to the ones computing winning strategies. In particular, for parity conditions, optimally resilient strategies are positional and can be computed in quasipolynomial time.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
