HyperLTL Satisfiability Is Highly Undecidable, HyperCTL$^*$ is Even Harder (2025)
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.46298/lmcs-21(1:3)2025
Publication URI: http://dx.doi.org/10.46298/lmcs-21(1:3)2025
Type: Journal Article/Review
Parent Publication: Logical Methods in Computer Science
ISSN: 1860-5974