References

  1. K. R. Apt, F. R. de Boer & E. R. Olderog (2009): Verification of Sequential and Concurrent Programs. Springer, doi:10.1007/978-1-84882-745-5.
  2. K. R. Apt, N. Francez & S. Katz (1988): Appraising fairness in distributed languages. Distributed Computing 2(4), pp. 226–241, doi:10.1007/BF01872848.
  3. M. Attamah, H. van Ditmarsch, D. Grossi & W. Van der Hoek (2014): Knowledge and gossip. In: Proceedings of ECAI'14. IOS Press, pp. 21–26.
  4. B. Baker & R. Shostak (1972): Gossips and Telephones. Discrete Mathematics 2, pp. 197–193, doi:10.1016/0012-365X(72)90001-5.
  5. R. Bumby (1981): A Problem with Telephones. SIAM Journal of Algorithms and Discrete Methods 2, pp. 13–18, doi:10.1137/0602002.
  6. E. W. Dijkstra (1975): Guarded commands, nondeterminacy and formal derivation of programs. Communications of the ACM 18, pp. 453–457, doi:10.1145/360933.360975.
  7. R. Fagin, J. Halpern, Y. Moses & M. Vardi (1997): Knowledge-Based Programs. Distributed Computing 10, pp. 199–225, doi:10.1007/s004460050038.
  8. Ronald Fagin, Joseph Y. Halpern, Yoram Moses & Moshe Y. Vardi (1995): Reasoning about knowledge. The MIT Press, Cambridge.
  9. A. Hajnal, E. C. Milner & E. Szemeredi (1972): A Cure for the Telephone Disease. Canadian Mathematical Bulletin 15, pp. 447–450, doi:10.4153/CMB-1972-081-0.
  10. S. M. Hedetniemi, S. T. Hedetniemi & A. L. Liestman (1988): A survey of gossiping and broadcasting in communication networks. Networks 18(4), pp. 319–349, doi:10.1002/net.3230180406.
  11. C. A. R. Hoare (1978): Communicating sequential processes. Communications of the ACM 21, pp. 666–677, doi:10.1145/359576.359585.
  12. INMOS Limited (1984): Occam Programming Manual. Prentice-Hall International.
  13. M. O. Jackson (2008): Social and Economic Networks.. Princeton University Press.
  14. R. Kurki-Suonio (1986): Towards programming with Knowledge Expressions. In: Proceedings of POPL'86, pp. 140–149, doi:10.1145/512644.512657.
  15. J.-J. Ch. Meyer & W. van der Hoek (1995): Epistemic Logic for AI and Computer Science. Cambridge Tracts in Theoretical Computer Science 41. Cambridge University Press, doi:10.1017/CBO9780511569852.
  16. R. Parikh & R. Ramanujam (1985): Distributed Processing and the Logic of Knowledge. In: Logic of Programs, LNCS 193. Springer, pp. 256–268, doi:10.1007/3-540-15648-8. Similar to JoLLI 12: 453–467, 2003.
  17. Á Seress (1986): Quick Gossiping without Duplicate Transmissions. Graphs and Combinatorics 2, pp. 363–383, doi:10.1007/BF01788111.
  18. R. Tijdeman (1971): On a telephone problem. Nieuw Archief voor Wiskunde 3(XIX), pp. 188–192.

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