Epistemic Protocols for Distributed Gossiping

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

REVIEW

Epistemic Protocols for Distributed Gossiping

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1606.07516 v1 pith:PY3HPYUT submitted 2016-06-24 cs.AI cs.DCcs.LOcs.MA

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

classification cs.AIcs.DCcs.LOcs.MA

keywords protocolsdistributedepistemicgossipmeansagentsanalyzeappropriate

verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

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.

Discussion (0). Continue with ORCID to comment.

Pith tools