Model Checking Knowledge and Linear Time: PSPACE Cases

DOI10.1007/978-3-540-72734-7_14MaRDI QIDQ5434507zbMATH OpenOpenAlexFDO

Authors Kai Engelhardt, Peter Gammie, Ron van der Meyden

Publication date 4 January 2008

Published in Logical Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72734-7_14

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Cited in

(15)

• Interpreting logics of knowledge in propositional dynamic logic
• Some simulation results as to weakly correlated processes
• Common knowledge and update in finite environments
• Model Checking Information Flow in Reactive Systems
• Knowledge = observation + memory + computation
• Optimizing epistemic model checking using conditional independence (extended abstract)
• Revisiting Satisfiability and Model-Checking for CTLK with Synchrony and Perfect Recall
• Well-structured model checking of multiagent systems
• Exponential acceleration of model checking for perfect recall systems
• scientific article; zbMATH DE number 140397 (Why is no real title available?)
• scientific article; zbMATH DE number 1500666 (Why is no real title available?)
• scientific article; zbMATH DE number 2087624 (Why is no real title available?)
• Undecidable cases of model checking probabilistic temporal-epistemic logic (extended abstract)
• Computer Aided Verification
• To know or not to know: Epistemic approaches to security protocol verification

Describes a project that uses

Uses Software

• MCMAS

This page was built for publication: Model Checking Knowledge and Linear Time: PSPACE Cases

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