Verification of distributed epistemic gossip protocols

MaRDI QIDQ4564781zbMATH OpenFDO

Authors Krzysztof R. Apt, Dominik Wojtczak

Publication date 12 June 2018

Full work available at URL https://www.jair.org/index.php/jair/article/view/11204

zbMATH Keywords

group communicationsknowledge based programpoint-to-point communications

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Logics of knowledge and belief (including belief change) (03B42) Network design and communication in computer systems (68M10) Specification and verification (program logics, model checking, etc.) (68Q60) Agent technology and artificial intelligence (68T42)

Recommendations

• On decidability of a logic of gossips
• scientific article; zbMATH DE number 7440211
• Common knowledge in a logic of gossips
• Epistemic protocols for dynamic gossip
• When Are Two Gossips the Same?

Cited in

(14)

• Propositional gossip protocols
• The logic of gossiping
• Minimal number of calls in propositional protocols
• On decidability of a logic of gossips
• Epistemic Cord logic: verifying anonymous routing protocols in Ad Hoc network
• scientific article; zbMATH DE number 7440211 (Why is no real title available?)
• Common knowledge in a logic of gossips
• Open problems in a logic of gossips
• Epistemic protocols for dynamic gossip
• To be announced
• Epistemic planning: perspectives on the special issue
• The logic of secrets and the interpolation rule
• The limits to gossip: second-order shared knowledge of all secrets is unsatisfiable
• You can only be lucky once: optimal gossip for epistemic goals

This page was built for publication: Verification of distributed epistemic gossip protocols

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