The Complexity of Fragments of Second-Order HyperLTL
The Complexity of Fragments of Second-Order HyperLTL
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
Ga?tan Regaud、Martin Zimmermann
数学
Ga?tan Regaud,Martin Zimmermann.The Complexity of Fragments of Second-Order HyperLTL[EB/OL].(2025-01-31)[2025-08-02].https://arxiv.org/abs/2501.19046.点此复制
评论