On the complexity of model checking knowledge and time

DOI10.1145/3637212MaRDI QIDQ6493419zbMATH OpenWikidataFDO

Authors Laura Bozzelli, Bastien Maubert, Aniello Murano

Publication date 26 April 2024

Published in ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3637212

zbMATH Keywords

complexityepistemic logicmodel checkingtemporal logic

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cited in

(3)

• The complexity of second-order HyperLTL
• Explainability requirements as hyperproperties
• The complexity of second-order HyperLTL

This page was built for publication: On the complexity of model checking knowledge and time

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