Expressiveness and decidability of temporal logics for asynchronous hyperproperties

DOI10.4230/LIPICS.CONCUR.2022.27MaRDI QIDQ6587135zbMATH OpenFDO

Authors Laura Bozzelli, Adriano Peron, César Sánchez

Publication date 13 August 2024

Full work available at URL https://doi.org/10.4230/LIPICS.CONCUR.2022.27

zbMATH Keywords

asynchronous hyperpropertiesdecidabilityexpressivenesshyperpropertiesmodel checkingtemporal logics for hyperproperties

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited in

(10)

• Introducing asynchronicity to probabilistic hyperproperties
• The complexity of second-order HyperLTL
• Hypernode automata
• Predicate abstraction for hyperliveness verification
• Hypernode automata
• HyperLTL satisfiability is highly undecidable, \(\mathrm{HyperCTL}^*\) is even harder
• The complexity of second-order HyperLTL
• Unifying asynchronous logics for hyperproperties
• Complexity of model checking second-order hyperproperties on finite structures
• Extensions of HyperLTL for asynchronous hyperproperties

This page was built for publication: Expressiveness and decidability of temporal logics for asynchronous hyperproperties

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