Minimal number of calls in propositional protocols

DOI10.1007/978-3-030-89716-1_9OpenAlexW3210437139MaRDI QIDQ2695494

Dominik Wojtczak, Joseph Livesey

Publication date: 31 March 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-89716-1_9

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Uses Software

• NetKAT

Cites Work

• Epistemic protocols for dynamic gossip
• 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
• The logic of gossiping
• On Decidability of a Logic of Gossips
• A survey of gossiping and broadcasting in communication networks
• A Problem with Telephones
• How to share knowledge by gossiping
• Knowledge-based programs
• When Are Two Gossips the Same?
• NetKAT
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimal number of calls in propositional protocols