Complexity of model checking second-order hyperproperties on finite structures
From MaRDI portal
Cites work
- A remark on the expressivity of asynchronous TeamLTL and HyperLTL
- A temporal logic for asynchronous hyperproperties
- Asynchronous extensions of hyperLTL
- AutoHyper: explicit-state model checking for HyperLTL
- Bounded model checking for hyperproperties
- Common knowledge and update in finite environments
- Expressiveness and decidability of temporal logics for asynchronous hyperproperties
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1500666 (Why is no real title available?)
- scientific article; zbMATH DE number 2102704 (Why is no real title available?)
- scientific article; zbMATH DE number 795590 (Why is no real title available?)
- HyperLTL satisfiability is highly undecidable, \(\mathrm{HyperCTL}^*\) is even harder
- Hypernode automata
- Knowledge and common knowledge in a distributed environment
- Reasoning with temporal logic on truncated paths.
- Second-order hyperproperties
- Set semantics for asynchronous TeamLTL: expressivity and complexity
- Team semantics for the specification and verification of hyperproperties
- The complexity of second-order HyperLTL
- Unifying asynchronous logics for hyperproperties
- Unifying hyper and epistemic temporal logics
- Weak Kripke structures and LTL
This page was built for publication: Complexity of model checking second-order hyperproperties on finite structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7317488)
