We propose a new self-stabilizing anonymous leader election algorithm in a tree graph. We show the correctness of the protocol and show that the protocol terminates in O(n4 ) time...
Wormhole routing is most common in parallel architectures in which messages are sent in small fragments called flits. It is a lightweight and efficient method of routing message...
Ajoy Kumar Datta, Maria Gradinariu, Anthony B. Ken...
We present the verification of a protocol designed to ensure self-stabilization in a ring of processors. The proof is organized as a series of refinements; it is mechanized base...