Minimal Number of Calls in Propositional Protocols

[1]  Frank Harary,et al.  The communication problem on graphs and digraphs , 1974 .

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

[3]  Malvin Gattinger,et al.  Towards an Analysis of Dynamic Gossip in Netkat , 2018, RAMiCS.

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

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

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

[7]  Wiebe van der Hoek,et al.  The logic of gossiping , 2020, Artif. Intell..

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

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

[10]  Hans van Ditmarsch,et al.  The Expected Duration of Sequential Gossiping , 2017, EUMAS/AT.

[11]  Andreas Herzig,et al.  How to Share Knowledge by Gossiping , 2015, EUMAS/AT.

[12]  Krzysztof R. Apt,et al.  Verification of Distributed Epistemic Gossip Protocols , 2018, J. Artif. Intell. Res..

[13]  Dominik Wojtczak,et al.  Propositional Gossip Protocols , 2021, FCT.

[14]  Nate Foster,et al.  NetKAT: semantic foundations for networks , 2014, POPL.

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

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

[17]  Martin C. Cooper,et al.  Temporal Epistemic Gossip Problems , 2018, EUMAS.

[18]  R. Bumby.  A Problem with Telephones , 1981 .

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