Verification of Distributed Epistemic Gossip Protocols
- Submitting institution
-
The University of Liverpool
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 12122
- Type
- D - Journal article
- DOI
-
10.1613/jair.1.11204
- Title of journal
- Journal of Artificial Intelligence Research
- Article number
- -
- First page
- 101
- Volume
- 62
- Issue
- -
- ISSN
- 1076-9757
- Open access status
- Compliant
- Month of publication
- May
- Year of publication
- 2018
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
1
- Research group(s)
-
-
- Citation count
- 1
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper combines and extends the conference papers "On Decidability of a Logic of Gossips" (JELIA'16) and "Decidability of Fair Termination of Gossip Protocols" (LPAR'17). The paper solves two open problems for epistemic gossiping: the logic is decidable and so are termination and correctness of its protocols. Based on this contribution, Wojtczak and co-authors also established the precise computational complexity of these problems in "On the Computational Complexity of Gossip Protocol" (IJCAI'17), which is not REF returned.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -