Affiliation:
1. CWI, The Netherlands
2. University of Warsaw, Poland
3. University of Liverpool, UK
Abstract
Gossip protocols deal with a group of communicating agents, each holding a 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 formulas from an epistemic logic. Recently, the implementability of these distributed protocols was established (which means that the evaluation of these formulas is decidable), and the problems of their partial correctness and termination were shown to be decidable, but their exact computational complexity was left open. We show that for any monotonic type of calls the implementability of a distributed epistemic gossip protocol is a P^{NP}_{||}-complete problem, while the problems of its partial correctness and termination are in coNP^{NP}.
Publisher
International Joint Conferences on Artificial Intelligence Organization
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. DEMon: Decentralized Monitoring for Highly Volatile Edge Environments;2022 IEEE/ACM 15th International Conference on Utility and Cloud Computing (UCC);2022-12
2. Propositional Gossip Protocols;Fundamentals of Computation Theory;2021
3. Minimal Number of Calls in Propositional Protocols;Lecture Notes in Computer Science;2021
4. Open Problems in a Logic of Gossips;Electronic Proceedings in Theoretical Computer Science;2019-07-19
5. Temporal Epistemic Gossip Problems;Multi-Agent Systems;2019