January 10, 2025 article Open access HyperLTL Satisfiability Is Highly Undecidable, HyperCTL$^*$ is Even Harder Logical Methods in Computer Science DOI: 10.46298/lmcs-21(1:3)2025 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 0 stored of 3 References 2 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access Probabilistic Hyperproperties with Nondeterminism 2020 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification Open access 23 citations Probabilistic Hyperproperties with Rewards 2022 Lecture notes in computer science conference-paper Computer Science Distributed systems and fault tolerance 6 citations 2 results