2026-08-16T06:05:14Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:6170 2024-03-06T10:38:28Z ddc:004 open_access

Deciding Hyperproperties Finkbeiner, Bernd Hahn, Christopher temporal logics satisfiability hyperproperties complexity Hyperproperties, like observational determinism or symmetry, cannot be expressed as properties of individual computation traces, because they describe a relation between multiple computation traces. HyperLTL is a temporal logic that captures such relations through trace variables, which are introduced through existential and universal trace quantifiers and can be used to refer to multiple computations at the same time. In this paper, we study the satisfiability problem of HyperLTL. We show that the problem is PSPACE-complete for alternation-free formulas (and, hence, no more expensive than LTL satisfiability), EXPSPACE-complete for exists-forall-formulas, and undecidable for forall-exists-formulas. Many practical hyperproperties can be expressed as alternation-free formulas. Our results show that both satisfiability and implication are decidable for such properties. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Bernd Finkbeiner and Christopher Hahn 2016 Is Part Of LIPIcs, Volume 59, 27th International Conference on Concurrency Theory (CONCUR 2016) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.CONCUR.2016.13 urn:nbn:de:0030-drops-61706 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2016.13 eng https://creativecommons.org/licenses/by/3.0/legalcode