Communication Dans Un Congrès Année : 2025

Wait-Only Broadcast Protocols are Easier to Verify

Résumé

We study networks of processes that all execute the same finite-state protocol and communicate via broadcasts. We are interested in two problems with a parameterized number of processes: the synchronization problem which asks whether there is an execution which puts all processes on a given state; and the repeated coverability problem which asks if there is an infinite execution where a given transition is taken infinitely often. Since both problems are undecidable in the general case, we investigate those problems when the protocol is Wait-Only, i.e., it has no state from which a process can both broadcast and receive messages. We establish that the synchronization problem becomes Ackermann-complete, and the repeated coverability problem is in ExpSpace and PSpace-hard.

Fichier principal
Vignette du fichier
main.pdf (791.07 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
licence

Dates et versions

hal-05625894 , version 1 (19-05-2026)

Licence

Identifiants

Citer

Lucie Guillou, Arnaud Sangnier, Nathalie Sznajder. Wait-Only Broadcast Protocols are Easier to Verify. 50th International Symposium on Mathematical Foundations of Computer Science (MFCS 2025), Aug 2025, Varsovie, Poland. pp.53:1--53:17, ⟨10.4230/LIPIcs.MFCS.2025.53⟩. ⟨hal-05625894⟩
0 Consultations
0 Téléchargements

Altmetric

Partager

  • More