The complexity of second-order HyperLTL
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1500666 (Why is no real title available?)
- scientific article; zbMATH DE number 6851935 (Why is no real title available?)
- scientific article; zbMATH DE number 795590 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- A remark on the expressivity of asynchronous TeamLTL and HyperLTL
- A temporal logic for asynchronous hyperproperties
- Algorithms for model checking HyperLTL and HyperCTL^*
- Asynchronous extensions of hyperLTL
- Expressiveness and decidability of temporal logics for asynchronous hyperproperties
- HyperATL*: A Logic for Hyperproperties in Multi-Agent Systems
- HyperLTL Satisfiability Is Σ₁¹-Complete, HyperCTL* Satisfiability Is Σ₁²-Complete.
- HyperLTL satisfiability is highly undecidable, \(\mathrm{HyperCTL}^*\) is even harder
- Hypernode automata
- On the complexity of linear temporal logic with team semantics
- On the complexity of model checking knowledge and time
- On the expressive power of TeamLTL and first-order team logic over hyperproperties
- Revisiting Satisfiability and Model-Checking for CTLK with Synchrony and Perfect Recall
- Second-order hyperproperties
- Set semantics for asynchronous TeamLTL: expressivity and complexity
- Team semantics for the specification and verification of hyperproperties
- Temporal team semantics revisited
- The Keys to Decidable HyperLTL Satisfiability: Small Models or Very Simple Formulas
- The complexity of propositional linear temporal logics
- The first-order logic of hyperproperties
- Unifying hyper and epistemic temporal logics
- “Sometimes” and “not never” revisited
This page was built for publication: The complexity of second-order HyperLTL
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6840483)
