References

  1. Carolyn Jane Anderson, Nate Foster, Arjun Guha, Jean-Baptiste Jeannin, Dexter Kozen, Cole Schlesinger & David Walker (2014): NetKAT: semantic foundations for networks. In: The 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '14. ACM, pp. 113–126, doi:10.1145/2535838.2535862.
  2. Krzysztof R. Apt, Davide Grossi & Wiebe van der Hoek (2018): When Are Two Gossips the Same?. In: Gilles Barthe, Geoff Sutcliffe & Margus Veanes: LPAR-22. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, EPiC Series in Computing 57. EasyChair, pp. 36–55, doi:10.29007/ww65.
  3. Krzysztof R. Apt, Davide Grossi & Wiebe van der Hoek (2016): Epistemic Protocols for Distributed Gossiping. In: Proceedings of the 15th Conference on Theoretical Aspects of Rationality and Knowledge (TARK 2015), EPTCS 215, pp. 51–66, doi:10.4204/EPTCS.215.5.
  4. Krzysztof R. Apt, Eryk Kopczyński & Dominik Wojtczak (2017): On the Computational Complexity of Gossip Protocols. In: Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, pp. 765–771, doi:10.24963/ijcai.2017/106.
  5. Krzysztof R. Apt & Dominik Wojtczak (2016): On Decidability of a Logic of Gossips. In: Proceedings of the 15th European Conference, JELIA 2016, Lecture Notes in Computer Science 10021. Springer, pp. 18–33, doi:10.1007/978-3-319-48758-8_2.
  6. Krzysztof R. Apt & Dominik Wojtczak (2017): Common Knowledge in a Logic of Gossips. In: Proc. of the 16th Conference on Theoretical Aspects of Rationality and Knowledge (TARK 2017), EPTCS 251, pp. 10–27, doi:10.4204/EPTCS.251.2.
  7. Krzysztof R. Apt & Dominik Wojtczak (2017): Decidability of Fair Termination of Gossip Protocols. In: Proc. of the 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR 21), Kalpa Publications in Computing 1, pp. 73–85, doi:10.29007/62s4.
  8. Krzysztof R. Apt & Dominik Wojtczak (2018): Verification of Distributed Epistemic Gossip Protocols. J. Artif. Intell. Res. (JAIR) 62, pp. 101–132, doi:10.1613/jair.1.11204.
  9. Maduka Attamah, Hans Van Ditmarsch, Davide Grossi & Wiebe van der Hoek (2014): A Framework for Epistemic Gossip Protocols. In: Proceedings of the 12th European Conference on Multi-Agent Systems (EUMAS 2014), Revised Selected Papers 8953. Springer, pp. 193–209, doi:10.1007/978-3-319-17130-2_13.
  10. Maduka Attamah, Hans Van Ditmarsch, Davide Grossi & Wiebe van der Hoek (2014): Knowledge and Gossip. In: Proceedings of ECAI'14. IOS Press, pp. 21–26, doi:10.3233/978-1-61499-419-0-21.
  11. Martin C. Cooper, Andreas Herzig, Faustine Maffre, Frédéric Maris & Pierre Régnier (2016): A simple account of multiagent epistemic planning. In: Proceedings of ECAI 2016. IOS Press, pp. 193–201, doi:10.3233/978-1-61499-672-9-193.
  12. Martin C. Cooper, Andreas Herzig, Faustine Maffre, Frédéric Maris & Pierre Régnier (2016): Simple Epistemic Planning: Generalised Gossiping. In: Proceedings of ECAI 2016, Frontiers in Artificial Intelligence and Applications 285. IOS Press, pp. 1563–1564, doi:10.3233/978-1-61499-672-9-1563.
  13. Martin C. Cooper, Andreas Herzig, Frédéric Maris & Julien Vianey (2018): Temporal Epistemic Gossip Problems. In: European Conference on Multi-Agent Systems. Springer, pp. 1–14, doi:10.1007/978-3-030-14174-5_1.
  14. Hans van Ditmarsch, Jan van Eijck, Pere Pardo, Rahim Ramezanian & François Schwarzentruber (2017): Epistemic Protocols for Dynamic Gossip. J. of Applied Logic 20(C), pp. 1–31, doi:10.1016/j.jal.2016.12.001.
  15. Hans van Ditmarsch, Jan van Eijck, Pere Pardo, Rahim Ramezanian & François Schwarzentruber (2018): Dynamic Gossip. Bull. Iran. Math. Soc., pp. 1–28, doi:10.1007/s41980-018-0160-4.
  16. Hans van Ditmarsch, Davide Grossi, Andreas Herzig, Wiebe van der Hoek & Louwe B. Kuijer (2016): Parameters for Epistemic Gossip Problems. In: Proceedings of the 12th Conference on Logic and the Foundations of Game and Decision Theory (LOFT 2016). Available at https://pdfs.semanticscholar.org/74b5/2c025f335ba487cac612019e39ce6c818448.pdf.
  17. Hans van Ditmarsch, Ioannis Kokkinis & Anders Stockmarr (2017): Reachability and Expectation in Gossiping. In: Bo An, Ana Bazzan, João Leite, Serena Villata & Leendert van der Torre: PRIMA 2017: Principles and Practice of Multi-Agent Systems. Springer International Publishing, Cham, pp. 93–109, doi:10.1007/978-3-319-69131-2_6.
  18. Ronald Fagin, Joseph Y. Halpern, Yoram Moses & Moshe Y. Vardi (1997): Knowledge-Based Programs. Distributed Computing 10(4), pp. 199–225, doi:10.1007/s004460050038.
  19. Malvin Gattinger & Jana Wagemaker (2018): Towards an Analysis of Dynamic Gossip in NetKAT. In: International Conference on Relational and Algebraic Methods in Computer Science. Springer, pp. 280–297, doi:10.1007/978-3-030-02149-8_17.
  20. Sandra M. Hedetniemi, Stephen T. Hedetniemi & Arthur L. Liestman (1988): A survey of gossiping and broadcasting in communication networks. Networks 18(4), pp. 319–349, doi:10.1002/net.3230180406.
  21. Andreas Herzig & Faustine Maffre (2015): How to Share Knowledge by Gossiping. In: Proc of the 13th European Conference on Multi-Agent Systems (EUMAS 2015), Revised Selected Papers 9571. Springer, pp. 249–263, doi:10.1007/978-3-319-33509-4_20.
  22. Andreas Herzig & Faustine Maffre (2017): How to Share Knowledge by Gossiping. AI Communications 30(1), pp. 1–17, doi:10.3233/AIC-170723.
  23. Charles A. R. Hoare (1978): Communicating Sequential Processes. Commun. ACM 21(8), pp. 666–677, doi:10.1145/359576.359585.
  24. Juraj Hromkovič, Ralf Klasing, Andrzej Pelc, Peter Ruzicka & Walter Unger (2005): Dissemination of Information in Communication Networks - Broadcasting, Gossiping, Leader Election, and Fault-Tolerance. Texts in Theoretical Computer Science. An EATCS Series. Springer, doi:10.1007/b137871.
  25. David Kempe, Alin Dobra & Johannes Gehrke (2003): Gossip-based computation of aggregate information. In: Proc. of the 44th Annual IEEE Symposium on Foundations of Computer Science, FOCS '03. IEEE, pp. 482–491, doi:10.1109/SFCS.2003.1238221.
  26. Anne-Marie Kermarrec & Maarten van Steen (2007): Gossiping in distributed systems. Operating Systems Review 41(5), pp. 2–7, doi:10.1145/1317379.1317381.
  27. Rivka Ladin, Barbara Liskov, Liuba Shrira & Sanjay Ghemawat (1992): Providing high availability using lazy replication. ACM Transactions on Computer Systems (TOCS) 10(4), pp. 360–391, doi:10.1145/138873.138877.
  28. Robin Milner (1980): A Calculus of Communicating Systems. Lecture Notes in Computer Science 92. Springer, doi:10.1007/3-540-10235-3.
  29. Davide Sangiorgi (2009): On the origins of bisimulation and coinduction. ACM Trans. Program. Lang. Syst. 31(4), pp. 15:1–15:41, doi:10.1145/1516507.1516510.
  30. Holger Spakowski & Jörg Vogel (2000): Θ^p_2-Completeness: A Classical Approach for New Results. In: International Conference on Foundations of Software Technology and Theoretical Computer Science. Springer, pp. 348–360, doi:10.1007/3-540-44450-5_28.
  31. Robert Tijdeman (1971): On a telephone problem. Nieuw Archief voor Wiskunde 3(XIX), pp. 188–192.
  32. Klaus W Wagner (1987): More complicated questions about maxima and minima, and some closures of NP. Theoretical Computer Science 51(1-2), pp. 53–80, doi:10.1016/0304-3975(87)90049-1.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org