Synchronization Modulo k in Dynamic Networks

DOI10.1007/978-3-030-91081-5_28MaRDI QIDQ6488455zbMATH OpenFDO

Authors Louis Penet de Monterno, Bernadette Charron-Bost, Stephan Merz

Publication date 21 April 2023

Full work available at URL https://doi.org/10.1007/978-3-030-91081-5_28

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Distributed algorithms (68W15)

Recommendations

• An efficient solution of the firing mob problem
• The firing squad problem revisited
• The firing squad problem revisited
• The synchronization of nonuniform networks of finite automata
• On the Complexity of the “Most General” Undirected Firing Squad Synchronization Problem

Cites work

• Authenticated Algorithms for Byzantine Agreement
• Coordinated consensus in dynamic networks
• Distributed computation in dynamic networks
• Isabelle/HOL. A proof assistant for higher-order logic
• Reaching Agreement in the Presence of Faults
• The firing squad problem revisited
• The Heard-Of model: computing in distributed systems with benign faults
• Universal dynamic synchronous self-stabilization

Cited in

(2)

• Synchronization modulo P in dynamic networks
• Computational Science – ICCS 2005

This page was built for publication: Synchronization Modulo k in Dynamic Networks

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