论文标题
基于回合随机游戏的符号验证和策略综合
Symbolic Verification and Strategy Synthesis for Turn-based Stochastic Games
论文作者
论文摘要
随机游戏是用于建模系统的便捷形式主义，包括在不确定的环境中竞争或协作的理性代理。此类模型的概率模型检查技术使我们能够正式指定集体或个人行为的定量规范，然后自动为保证满足这些规范的代理人合成策略。尽管在算法和工具支持方面取得了良好的进展，但效率和可扩展性仍然是一个挑战。在本文中，我们研究了基于多末端二进制决策图的符号实现。我们描述了如何针对基于零和NASH平衡的时间逻辑规范来构建和验证基于转弯的随机游戏。我们为这类游戏整理了一组基准，并评估了我们的方法的性能，表明它在许多情况下都很出色，并且以象征性方式综合的策略可以更加紧凑。
Stochastic games are a convenient formalism for modelling systems that comprise rational agents competing or collaborating within uncertain environments. Probabilistic model checking techniques for this class of models allow us to formally specify quantitative specifications of either collective or individual behaviour and then automatically synthesise strategies for the agents under which these specifications are guaranteed to be satisfied. Although good progress has been made on algorithms and tool support, efficiency and scalability remain a challenge. In this paper, we investigate a symbolic implementation based on multi-terminal binary decision diagrams. We describe how to build and verify turn-based stochastic games against either zero-sum or Nash equilibrium based temporal logic specifications. We collate a set of benchmarks for this class of games, and evaluate the performance of our approach, showing that it is superior in a number of cases and that strategies synthesised in a symbolic fashion can be considerably more compact.
