Minimal number of calls in propositional protocols

DOI10.1007/978-3-030-89716-1_9MaRDI QIDQ2695494zbMATH OpenOpenAlexFDO

Authors Joseph Livesey, Dominik Wojtczak

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)

Cites work

• A Problem with Telephones
• A survey of gossiping and broadcasting in communication networks
• Common knowledge in a logic of gossips
• Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
• Epistemic protocols for dynamic gossip
• How to share knowledge by gossiping
• scientific article; zbMATH DE number 7440211 (Why is no real title available?)
• scientific article; zbMATH DE number 6747860 (Why is no real title available?)
• scientific article; zbMATH DE number 3358479 (Why is no real title available?)
• Knowledge-based programs
• Netkat, semantic foundations for networks
• On decidability of a logic of gossips
• Open problems in a logic of gossips
• Reachability and expectation in gossiping
• The logic of gossiping
• Towards an analysis of dynamic gossip in Net\textsc{kat}
• Verification of distributed epistemic gossip protocols
• When Are Two Gossips the Same?

Describes a project that uses

Uses Software

• NetKAT

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2695494)