Correctness Proof for a Network Synchronizer

Author(s)
Devarajan, Harish; Fekete, Alan; Lynch, Nancy A.; Shrira, Liuba
Thumbnail
DownloadMIT-LCS-TR-588.pdf (1.736Mb)
Metadata
Show full item record
Abstract
In this paper we offer a formal, rigorous proof of the correctness of Awerbuch's algorithm for network synchronization [1]. We specify both the algorithm and the correctness condition using the I/O automaton model.
Date issued
1993-12
URI
https://hdl.handle.net/1721.1/149753
Series/Report no.
MIT-LCS-TR-588
Collections