Playing games with boxes and diamonds

Rajeev Alur, Salvatore La Torre, P. Madhusudan

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

Deciding infinite two-player games on finite graphs with the winning condition specified by a linear temporal logic (LTL) formula, is known to be 2ExPTIME-complete. The previously known hardness proofs encode Turing machine computations using the next and/or until operators. Furthermore, in the case of model checking, disallowing next and until, and retaining only the always and eventually operators, lowers the complexity from PSPACE to NP. Whether such a reduction in complexity is possible for deciding games has been an open problem. In this paper, we provide a negative answer to this question. We introduce new techniques for encoding Turing machine computations using games, and show that deciding games for the LTL fragment with only the always and eventually operators is 2EXPTIME-hard. We also prove- that if in this fragment we do not allow the eventually operator in the scope of the always operator and vice-versa, deciding games is EXPSPACE-hard, matching the previously known upper bound. On the positive side, we show that if the winning condition is a Boolean combination of formulas of the form "eventually p" and "infinitely often p," for a state-formula p, then the game can be decided in PSPACE, and also establish a matching lower bound. Such conditions include safety and reachability specifications on game graphs augmented with fairness conditions for the two players.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsRoberto Amadio, Denis Lugiez
PublisherSpringer-Verlag Berlin Heidelberg
Pages128-143
Number of pages16
ISBN (Print)3540407537, 9783540407539
DOIs
StatePublished - 2003

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2761
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Playing games with boxes and diamonds'. Together they form a unique fingerprint.

  • Cite this

    Alur, R., La Torre, S., & Madhusudan, P. (2003). Playing games with boxes and diamonds. In R. Amadio, & D. Lugiez (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 128-143). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2761). Springer-Verlag Berlin Heidelberg. https://doi.org/10.1007/978-3-540-45187-7_8