The Complexity of Fragments of Second-Order HyperLTL
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908541789405184 |
|---|---|
| author | Regaud, Gaëtan Zimmermann, Martin |
| author_facet | Regaud, Gaëtan Zimmermann, Martin |
| contents | 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 |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_19046 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | The Complexity of Fragments of Second-Order HyperLTL Regaud, Gaëtan Zimmermann, Martin Logic in Computer Science 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 |
| title | The Complexity of Fragments of Second-Order HyperLTL |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2501.19046 |