Decidability of Fair Termination of Gossip Protocols

13 pages•Published: June 4, 2017

Abstract

Gossip protocols deal with a group of communicating agents, each holding some private information, and aim at arriving at a situation in which all the agents know each other secrets. Distributed epistemic gossip protocols are particularly simple distributed programs that use as guards formulas from an epistemic logic. We showed recently that the implementability of these distributed gossip protocols and the problems of their partial correctness and termination are decidable, but the problem of decidability of their fair termination was left open. We study here rule-fair and agent-fair termination of these protocols and show that both properties are decidable.

Keyphrases: computational complexity of reasoning, epistemic logic, fair termination, gossip protocols, knowledge based programs

In: Thomas Eiter, David Sands, Geoff Sutcliffe and Andrei Voronkov (editors). IWIL Workshop and LPAR Short Presentations, vol 1, pages 73-85.

Links:	https://easychair.org/publications/paper/2cZ
	https://doi.org/10.29007/62s4

BibTeX entry

@inproceedings{LPAR-21S:Decidability_Fair_Termination_Gossip,
  author    = {Krzysztof Apt and Dominik Wojtczak},
  title     = {Decidability of Fair Termination of Gossip Protocols},
  booktitle = {IWIL Workshop and LPAR Short Presentations},
  editor    = {Thomas Eiter and David Sands and Geoff Sutcliffe and Andrei Voronkov},
  series    = {Kalpa Publications in Computing},
  volume    = {1},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2515-1762},
  url       = {/publications/paper/2cZ},
  doi       = {10.29007/62s4},
  pages     = {73-85},
  year      = {2017}}

Download PDF Open PDF in browser