Verification of Distributed Epistemic Gossip Protocols

htmlabstract 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 secrets. Distributed epistemic gossip protocols use as guards formulas from a simple epistemic logic and as statements calls between the agents. They are natural examples of knowledge based programs. We prove here that these protocols are implementable, that their partial correctness is decidable and that termination and two forms of fair termination of these protocols are decidable, as well. To establish these results we show that the definition of semantics and of truth of the underlying logic are decidable.

[1]  Johannes Gehrke,et al.  Gossip-based computation of aggregate information , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[2]  Andreas Herzig,et al.  How to share knowledge by gossiping , 2017, AI Commun..

[3]  Krzysztof R. Apt,et al.  On Decidability of a Logic of Gossips , 2016, JELIA.

[4]  Wiebe van der Hoek,et al.  When Are Two Gossips the Same? Types of Communication in Epistemic Gossip Protocols , 2018, ArXiv.

[5]  Edsger W. Dijkstra,et al.  Guarded commands, nondeterminacy and formal derivation of programs , 1975, Commun. ACM.

[6]  Krzysztof R. Apt,et al.  Decidability of Fair Termination of Gossip Protocols , 2017, IWIL@LPAR.

[7]  Thomas Wilke,et al.  Synthesis of Distributed Systems from Knowledge-Based Specifications , 2005, CONCUR.

[8]  Krzysztof R. Apt,et al.  Common Knowledge in a Logic of Gossips , 2017, TARK.

[9]  Wiebe van der Hoek,et al.  Epistemic Protocols for Distributed Gossiping , 2016, TARK.

[10]  Lutz Priese,et al.  Fairness , 1988, Bull. EATCS.

[11]  Krzysztof R. Apt,et al.  On the Computational Complexity of Gossip Protocols , 2017, IJCAI.

[12]  Nissim Francez,et al.  Appraising fairness in languages for distributed programming , 2005, Distributed Computing.

[13]  Andreas Herzig,et al.  Parameters for Epistemic Gossip Problems , 2016 .

[14]  Jan van Eijck,et al.  Epistemic protocols for dynamic gossip , 2017, J. Appl. Log..

[15]  C. A. R. HOARE,et al.  An axiomatic basis for computer programming , 1969, CACM.

[16]  Arthur L. Liestman,et al.  A survey of gossiping and broadcasting in communication networks , 1988, Networks.

[17]  Inmos Corp,et al.  Occam Programming Manual , 1984 .

[18]  Wiebe van der Hoek,et al.  Knowledge and Gossip , 2014, ECAI.

[19]  Liuba Shrira,et al.  Providing high availability using lazy replication , 1992, TOCS.

[20]  Andrzej Pelc,et al.  Dissemination of Information in Communication Networks - Broadcasting, Gossiping, Leader Election, and Fault-Tolerance , 2005, Texts in Theoretical Computer Science. An EATCS Series.

[21]  Ronald Fagin,et al.  Knowledge-based programs , 1997, Distributed Computing.

[22]  Anders Stockmarr,et al.  Reachability and Expectation in Gossiping , 2017, PRIMA.

[23]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[24]  Wiebe van der Hoek,et al.  A Framework for Epistemic Gossip Protocols , 2014, EUMAS.

[25]  Martin C. Cooper,et al.  Simple Epistemic Planning: Generalised Gossiping , 2016, ECAI.

[26]  Amir Pnueli,et al.  Impartiality, Justice and Fairness: The Ethics of Concurrent Termination , 1981, ICALP.

[27]  Martin C. Cooper,et al.  A simple account of multiagent epistemic planning , 2015 .

[28]  Anne-Marie Kermarrec,et al.  Gossiping in distributed systems , 2007, OPSR.