Epistemic Protocols for Distributed Gossiping

Davide Grossi (University of Liverpool); Krzysztof R. Apt (Centrum Wiskunde Informatica); Wiebe van der Hoek (University of Liverpool)

arxiv: 1606.07516 · v1 · pith:PY3HPYUT · submitted 2016-06-24 · cs.AI · cs.DC· cs.LO· cs.MA

Epistemic Protocols for Distributed Gossiping

Krzysztof R. Apt (Centrum Wiskunde Informatica) , Davide Grossi (University of Liverpool) , Wiebe van der Hoek (University of Liverpool) This is my paper

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:PY3HPYUT record.json open to challenge →

classification cs.AI cs.DCcs.LOcs.MA

keywords protocolsdistributedepistemicgossipmeansagentsanalyzeappropriate

0 comments

read the original abstract

Gossip protocols aim at arriving, by means of point-to-point or group communications, at a situation in which all the agents know each other's secrets. We consider distributed gossip protocols which are expressed by means of epistemic logic. We provide an operational semantics of such protocols and set up an appropriate framework to argue about their correctness. Then we analyze specific protocols for complete graphs and for directed rings.

This paper has not been read by Pith yet.

Epistemic Protocols for Distributed Gossiping

discussion (0)