knowΔ, but they ignore what nodes are the centers of the spanning stars. We also prove that if the bound Δ for guaranteeing spanning stars exists but is unknown to the agents, then mod k-synchronization is impossible.
All nodes in our algorithm fire in less than 6kn + 4k rounds after all nodes become active, but unfortunately use unbounded counters. We then propose a refinement of this algorithm so that it becomes finite state while maintaining the same time complexity. The correctness of our first algorithm has been formally established in the proof assistant Isabelle.
@InProceedings{penet:synchronization-sss, author = {Louis Penet de Monterno and Bernadette Charron-Bost and Stephan Merz}, title = {Synchronization Modulo $k$ in Dynamic Networks}, booktitle = {23rd Intl. Symp. Stabilization, Safety, and Security of Distributed Systems (SSS 2021)}, year = 2021, editor = {Colette Johnen and Elad Michael Schiller and Stefan Schmid}, volume = 13046, series = {Lecture Notes in Computer Science}, pages = {425--439}, address = {Gothenburg, Sweden (online)}, publisher = {Springer}, }