The complexity of HyperQPTL

DOI10.1016/J.IPL.2026.106626MaRDI QIDQ7227489zbMATH OpenFDO

Authors Gaëtan Regaud, Martin Zimmermann

Publication date 10 April 2026

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.IPL.2026.106626

zbMATH Keywords

satisfiabilitymodel-checkinghyperlogicsHyperQPTL

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 6851935 (Why is no real title available?)
• Algorithms for model checking HyperLTL and HyperCTL^*
• HyperLTL satisfiability is highly undecidable, \(\mathrm{HyperCTL}^*\) is even harder
• Realizing \(\omega\)-regular hyperproperties
• Second-order hyperproperties
• The Keys to Decidable HyperLTL Satisfiability: Small Models or Very Simple Formulas

This page was built for publication: The complexity of HyperQPTL

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7227489)