Model-Checking Alternating-Time Temporal Logic with Strategies Based on Common Knowledge is Undecidable

Raluca Diaconu (1) , Catalin Dima (2)

1 Regal - Large-Scale Distributed Systems and Applications
2 LACL - Laboratoire d'Algorithmique Complexité et Logique

We present a semantics for the Alternating-time Temporal Logic (ATL) with imperfect information, in which the participants in a coalition choose their strategies such that each agent's choice is the same in all states that form the common knowledge for the coaltion. We show that ATL with this semantics has an undecidable model-checking problem if the semantics is also synchronous and the agents have perfect recall.

Domaines: Informatique [cs]

Raluca Diaconu, Catalin Dima. Model-Checking Alternating-Time Temporal Logic with Strategies Based on Common Knowledge is Undecidable. Applied Artificial Intelligence, 2012, 26 (4), pp.331--348. ⟨10.1080/08839514.2012.652905⟩. ⟨hal-01699945⟩