2013/07/17 by François Laroussinie, Nicolas Markey
Computer Science · #cs.LO #cs.GT #cs.MA
paper · pdf · doi:10.4204/eptcs.119.18
published as EPTCS 119, 2013, pp. 208-223 · In Proceedings GandALF 2013, arXiv:1307.4162
arxiv created 2013/07/17 · arxiv updated 2013/07/18
Various extensions of the temporal logic ATL have recently been introduced to express rich properties of multi-agent systems. Among these, ATLsc extends ATL with strategy contexts, while Strategy Logic has first-order quantification over strategies. There is a price to pay for the rich expressiveness of these logics: model-checking is non-elementary, and satisfiability is undecidable. We prove in this paper that satisfiability is decidable in several special cases. The most important one is when restricting to turn-based games. We prove that decidability also holds for concurrent games if the number of moves available to the agents is bounded. Finally, we prove that restricting strategy quantification to memoryless strategies brings back undecidability.