Epistemic protocols for dynamic gossip

Ditmarsch, Hans van; Eijck, Jan van; Pardo, Pere; Ramezanian, Rahim; Schwarzentruber, François

doi:10.1016/j.jal.2016.12.001

Cited by 30 publications

(22 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The calls considered there differ from the ones considered here, so their approach is not applicable to our setting. In turn, in [18] dynamic distributed gossip protocols are studied in which the calls allow the agents not only to share the secrets but also to transmit the links. The purpose of the paper is to characterise such protocols in terms of the class of graphs for which they terminate.…”

Section: Related Workmentioning

confidence: 99%

Decidability of Fair Termination of Gossip Protocols

Apt¹,

Wojtczak²

Kalpa Publications in Computing

View full text Add to dashboard Cite

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.

show abstract

Section: Related Workmentioning

confidence: 99%

Decidability of Fair Termination of Gossip Protocols

Apt¹,

Wojtczak²

Kalpa Publications in Computing

View full text Add to dashboard Cite

show abstract

“…Next, in [14] dynamic distributed gossip protocols were studied in which the calls allow the agents not only to share the secrets but also to transmit the links. These protocols were characterized in terms of the class of graphs for which they terminate.…”

Section: Related Workmentioning

confidence: 99%

Open Problems in a Logic of Gossips

Apt

Wojtczak

2019

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

Gossip protocols are programs used in a setting in which each agent holds a secret and the aim is to reach a situation in which all agents know all secrets. Such protocols rely on a point-to-point or group communication. Distributed epistemic gossip protocols use epistemic formulas in the component programs for the agents. The advantage of the use of epistemic logic is that the resulting protocols are very concise and amenable for a simple verification.Recently, we introduced a natural modal logic that allows one to express distributed epistemic gossip protocols and to reason about their correctness. We proved that the resulting protocols are implementable and that all aspects of their correctness, including termination, are decidable. To establish these results we showed that both the definition of semantics and of truth of the underlying logic are decidable. We also showed that the analogous results hold for an extension of this logic with the 'common knowledge' operator.However, several, often deceptively simple, questions about this logic and the corresponding gossip protocols remain open. The purpose of this paper is to list and elucidate these questions and provide for them an appropriate background information in the form of partial of related results.

show abstract

“…The protocol conditions used in this work satisfy locality in an obvious way. Gossip protocol specification languages are investigated in [1,24].…”

Section: Definition 3 (Call Sequence)mentioning

confidence: 99%

“…One direction for further research are gossip protocols with protocol conditions that involve higher-order knowledge, for example: I will only call you if I know that you can inform me with a new secret in that call. Such a follow-up investigation, not focussed on characterization but on (a)synchronicity (absence or presence of a global clock), has appeared in [24]. Gossip protocols with unidirectional information change (push or pull, instead of pushpull), seem promising to find novel characterization graph topologies, as well as parallel gossip protocols with rounds of calls.…”

Section: Conclusion and Further Researchmentioning

confidence: 99%

Dynamic Gossip

Ditmarsch

Eijck

Pardo

et al. 2018

Bull. Iran. Math. Soc.

Self Cite

View full text Add to dashboard Cite

A gossip protocol is a procedure for spreading secrets among a group of agents, using a connection graph. The goal is for all agents to get to know all secrets, in which case we call the execution of the protocol successful. We consider distributed and dynamic gossip protocols. In distributed gossip the agents themselves instead of a global scheduler determine whom to call. In dynamic gossip not only secrets are exchanged but also telephone numbers (agent identities). This results in increased graph connectivity. We define six such distributed dynamic gossip protocols, and we characterize them in terms of the topology of the graphs on which they are successful, wherein we distinguish strong success (the protocol always terminates, possibly assuming fair scheduling) from weak success (the protocol sometimes terminates). For five of these protocols strong (fair) and weak success are characterized by weakly connected graphs. This result is surprising because the protocols are fairly different. In the sixth protocol an agent may only call another agent if it does not know the other agent's secret. Strong success for this protocol is characterized by graphs for which the set of non-terminal nodes is strongly connected. Weak success for this protocol is characterized by weakly connected graphs satisfying further topological constraints that we define in the paper. One direction of this characterization is surprisingly harder to prove than the other results in this contribution.

show abstract

Epistemic protocols for dynamic gossip

Cited by 30 publications

References 17 publications

Decidability of Fair Termination of Gossip Protocols

Decidability of Fair Termination of Gossip Protocols

Open Problems in a Logic of Gossips

Dynamic Gossip

Contact Info

Product

Resources

About