The Complexity of Fragments of Second-Order HyperLTL
arXiv:2501.19046
Abstract
We settle the complexity of satisfiability, finite-state satisfiability, and model-checking for several fragments of second-order HyperLTL, which extends HyperLTL with quantification over sets of traces: they are all in the analytical hierarchy and beyond
arXiv commentarXiv admin note: text overlap with arXiv:2311.15675