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
@article{arxiv.2501.19046,
title = {The Complexity of Fragments of Second-Order HyperLTL},
author = {Gaëtan Regaud and Martin Zimmermann},
journal= {arXiv preprint arXiv:2501.19046},
year = {2025}
}
Comments
arXiv admin note: text overlap with arXiv:2311.15675