Complexity of model checking for logics over Kripke models

MaRDI QIDQ4584892zbMATH OpenFDO

Authors Arne Meier, Julian-Steffen Müller, Martin Mundhenk, Heribert Vollmer

Publication date 4 September 2018

Full work available at URL http://eatcs.org/beatcs/index.php/beatcs/article/view/50

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Recommendations

• scientific article; zbMATH DE number 2196601
• scientific article; zbMATH DE number 1705163
• Complexity of model checking for modal dependence logic
• Model checking for hybrid branching-time logics
• The complexity of satisfiability for fragments of CTL and \(\text{CTL}^*\)

Cited in

(13)

• scientific article; zbMATH DE number 2163033 (Why is no real title available?)
• Minimal Proof Search for Modal Logic K Model Checking
• The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions
• scientific article; zbMATH DE number 2196592 (Why is no real title available?)
• Submodel enumeration of Kripke structures in modal logic
• Completeness and complexity of multi-modal CTL
• scientific article; zbMATH DE number 2087436 (Why is no real title available?)
• A new model for model checking: cycle-weighted Kripke structure
• Complexity of model checking for cardinality-based belief revision operators
• scientific article; zbMATH DE number 2196601 (Why is no real title available?)
• scientific article; zbMATH DE number 1705163 (Why is no real title available?)
• The model checking fingerprints of CTL operators
• Mathematical Foundations of Computer Science 2005

This page was built for publication: Complexity of model checking for logics over Kripke models

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