Model-checking ATL under Imperfect Information and Perfect Recall Semantics is Undecidable

Cătălin Dima, Ferucio Laurenţiu Ţiplea

arXiv (Cornell University) · 2011 · 77 citations · 3 references

DOIFull text

Open access

Concepts

Abstract

We propose a formal proof of the undecidability of the model checking problem for alternating- time temporal logic under imperfect information and perfect recall semantics. This problem was announced to be undecidable according to a personal communication on multi-player games with imperfect information, but no formal proof was ever published. Our proof is based on a direct reduction from the non-halting problem for Turing machines.

References

3