The Complexity of Asynchronous HyperLTL
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
The Complexity of Asynchronous HyperLTL
arXiv:2606.06091v1 Announce Type: new Abstract: Hyperproperties express, e.g., information-flow properties of systems, which involves the simultaneous reasoning about multiple execution traces of a system. Consequently, HyperLTL, the most important specification logic for hyperproperties, extends LTL with quantification over traces. However, HyperLTL can only express synchronous hyperproperties.
The Complexity of Generalized HyperLTL with Stuttering and Contexts
Announce Type: replace Abstract: We settle the complexity of satisfiability, finite-state satisfiability, and model-checking for generalized HyperLTL with stuttering and contexts, an expressive logic for the specification of asynchronous hyperproperties. Such properties cannot be specified in HyperLTL, as it is restricted to synchronous hyperproperties. Nevertheless, we prove that satisfiability is $\Sigma_1^1$-complete and thus not harder than for HyperLTL.