Realizability problem for constraint LTL

Abstract

Constraint linear-time temporal logic (CLTL) is an extension of LTL that is interpreted on sequences of valuations of variables over an infinite domain. Atomic formulas can constrain valuations over a range of positions along a sequence, with the range being bounded by a parameter depending on the formula. The satisfiability and model checking problems for CLTL have been studied before. We consider the realizability problem for CLTL. The set of variables is partitioned into two parts, with each part controlled by a player. Players take turns to choose valuations for their variables, generating a sequence of valuations. The winning condition is specified by a CLTL formula — the first player wins if the sequence of valuations satisfies the specified formula. We prove that checking whether the first player has a winning strategy in the realizability game for a given CLTL formula is undecidable in general and identify decidable fragments.