Optimizing epistemic model checking using conditional independence (extended abstract)

MaRDI QIDQ3384082zbMATH OpenFDO

Authors Ron van der Meyden

Publication date 14 December 2021

Full work available at URL https://arxiv.org/abs/1707.08756, http://eptcs.web.cse.unsw.edu.au/paper.cgi?TARK2017.29

Mathematics Subject Classification ID

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

Recommendations

• Improved Bounded Model Checking for a Fair Branching-Time Temporal Epistemic Logic
• scientific article; zbMATH DE number 2182497
• Conditional independence in propositional logic.
• Parallel model checking for temporal epistemic logic
• Symbolic Model Checking for Dynamic Epistemic Logic

Cites work

• A logical notion of conditional independence: properties and applications
• Automatic verification of temporal-epistemic properties of cryptographic protocols
• Computation in valuation algebras
• Embedding Logics in the Local Computation Framework
• Formal Design of Asynchronous Fault Detection and Identification Components using Temporal Epistemic Logic
• scientific article; zbMATH DE number 3823168 (Why is no real title available?)
• scientific article; zbMATH DE number 1168533 (Why is no real title available?)
• Independence properties of directed markov fields
• Model Checking Knowledge and Linear Time: PSPACE Cases
• Model checking Russian cards
• Nonserial dynamic programming
• Probabilistic graphical models.
• The dining cryptographers problem: Unconditional sender and recipient untraceability

Cited in

(2)

• Approximate verification of strategic abilities under imperfect information
• Symbolic model checking for Dynamic Epistemic Logic — S5 and beyond*

This page was built for publication: Optimizing epistemic model checking using conditional independence (extended abstract)

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