Epistemic protocols for dynamic gossip
From MaRDI portal
Publication:504511
DOI10.1016/j.jal.2016.12.001zbMath1401.68017OpenAlexW2560625631MaRDI QIDQ504511
François Schwarzentruber, Jan van Eijck, Rahim Ramezanian, Pere Pardo, Hans P. van Ditmarsch
Publication date: 16 January 2017
Published in: Journal of Applied Logic (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/25365
Related Items
Propositional gossip protocols ⋮ Everyone knows that everyone knows ⋮ Dynamic gossip ⋮ A logical study of group-size based social network creation ⋮ A separation logic with histories of epistemic actions as resources ⋮ Minimal number of calls in propositional protocols ⋮ Unnamed Item ⋮ The logic of gossiping ⋮ The epistemic gossip problem ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A lightweight epistemic logic and its application to planning
Cites Work
- The communication problem on graphs
- Propositional dynamic logic of regular programs
- A knowledge based semantics of messages
- Distributed Resource Discovery in Sub-Logarithmic Time
- A Poor Man’s Epistemic Logic Based on Propositional Assignment and Higher-Order Observation
- Knowledge and common knowledge in a distributed environment
- Dynamic Epistemic Logic and Knowledge Puzzles
- A survey of gossiping and broadcasting in communication networks
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item