加载中…
2025-01-31
The Complexity of Fragments of Second-Order HyperLTL
Gaëtan RegaudMartin Zimmermann
文献摘要
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
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本