The complexity of epistemic model checking: clock semantics and branching time

DOI10.3233/978-1-60750-606-5-549MaRDI QIDQ2999188zbMATH OpenFDO

Authors Xiaowei Huang, Ron van der Meyden

Publication date 11 May 2011

Full work available at URL https://doi.org/10.3233/978-1-60750-606-5-549

Mathematics Subject Classification ID

Logics of knowledge and belief (including belief change) (03B42) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in artificial intelligence (68T27)

Recommendations

• Undecidable Cases of Model Checking Probabilistic Temporal-Epistemic Logic
• scientific article; zbMATH DE number 1500666
• Undecidable cases of model checking probabilistic temporal-epistemic logic (extended abstract)
• Symbolic model checking for temporal-epistemic logic
• scientific article; zbMATH DE number 2087624

Cited in

(5)

• Undecidable cases of model checking probabilistic temporal-epistemic logic (extended abstract)
• Checking EMTLK properties of timed interpreted systems via bounded model checking
• scientific article; zbMATH DE number 5051662 (Why is no real title available?)
• Exponential improvement of time complexity of model checking for multiagent systems with perfect recall
• Improved Bounded Model Checking for a Fair Branching-Time Temporal Epistemic Logic

This page was built for publication: The complexity of epistemic model checking: clock semantics and branching time

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