On the complexity of linear temporal logic with team semantics

Abstract

A specification given as a formula in linear temporal logic (LTL) defines a system by its set of traces. However, certain features such as information flow security constraints are rather modeled as so-called hyperproperties, which are sets of sets of traces. One logical approach to this is team logic, which is a logical framework for the specification of dependence and independence of information. LTL with team semantics has recently been discovered as a logic for hyperproperties.We study the complexity theoretic aspects of LTL with so-called synchronous team semantics and Boolean negation, and prove that both its model checking and satisfiability problems are highly undecidable, and equivalent to the decision problem of third-order arithmetic. Furthermore, we prove that this complexity already appears at small temporal depth and with only the “future” modality F. Finally, we also introduce a team-semantical generalization of stutter-invariance.