Information and Computation ( IF 1 ) Pub Date : 2020-03-26 , DOI: 10.1016/j.ic.2020.104554 Valentin Goranko , Antti Kuusisto , Raine Rönnholm
We develop a game-theoretic semantics () for the fragment of the alternating-time temporal logic , thereby extending the recently introduced for . We show that the game-theoretic semantics is equivalent to the standard compositional semantics of with perfect-recall strategies. Based on the new semantics, we provide an analysis of the memory and time resources needed for model checking and show that strategies of the verifier that use only a very limited amount of memory suffice. Furthermore, using the , we provide a new algorithm for model checking and identify a natural hierarchy of tractable fragments of that substantially extend .
中文翻译:
ATL +的博弈论语义及其在模型检查中的应用
我们开发了一种博弈论的语义()的片段 时间逻辑的概念 ,从而扩展了最近推出的 对于 。我们证明了博弈论的语义等同于博弈论的标准构成语义。具有完善的召回策略。基于新的语义,我们提供了模型检查所需的内存和时间资源的分析并表明仅使用非常有限的内存量的验证程序策略就足够了。此外,使用,我们提供了一种用于模型检查的新算法 并确定自然易碎片段的层次结构 大大扩展 。