Synchronization modulo \(P\) in dynamic networks

DOI10.1016/J.TCS.2022.11.033OpenAlexW4310424084MaRDI QIDQ2110375

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

Publication date: 21 December 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.11.033

zbMATH Keywords

synchronizationdistributed computingdynamic graphfiring squad

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Uses Software

• Isabelle/HOL
• Archive Formal Proofs

Cites Work

• Stabilizing phase-clocks
• Synchronous vs. asynchronous unison
• Isabelle/HOL. A proof assistant for higher-order logic
• MinMax algorithms for stabilizing consensus
• The firing squad problem revisited
• The Heard-Of model: computing in distributed systems with benign faults
• Distributed computation in dynamic networks
• Coordinated consensus in dynamic networks
• Authenticated Algorithms for Byzantine Agreement
• Reaching Agreement in the Presence of Faults
• Universal dynamic synchronous self-stabilization
• Synchronization Modulo k in Dynamic Networks

This page was built for publication: Synchronization modulo \(P\) in dynamic networks