scientific article; zbMATH DE number 7450017
From MaRDI portal
Publication:5018499
Krzysztof R. Apt, Dominik Wojtczak
Publication date: 20 December 2021
Full work available at URL: https://arxiv.org/abs/1907.09097
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Propositional gossip protocols, Everyone knows that everyone knows, Minimal number of calls in propositional protocols, The logic of gossiping
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Epistemic protocols for dynamic gossip
- More complicated questions about maxima and minima, and some closures of NP
- A calculus of communicating systems
- Towards an analysis of dynamic gossip in Net\textsc{kat}
- Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
- Reachability and expectation in gossiping
- Dynamic gossip
- On Decidability of a Logic of Gossips
- A survey of gossiping and broadcasting in communication networks
- Communicating sequential processes
- How to share knowledge by gossiping
- Knowledge-based programs
- When Are Two Gossips the Same?
- NetKAT
