Correctness Proof for a Network Synchronizer
| dc.contributor.author | Devarajan, Harish | en_US |
| dc.contributor.author | Fekete, Alan | en_US |
| dc.contributor.author | Lynch, Nancy A. | en_US |
| dc.contributor.author | Shrira, Liuba | en_US |
| dc.date.accessioned | 2023-03-29T15:21:01Z | |
| dc.date.available | 2023-03-29T15:21:01Z | |
| dc.date.issued | 1993-12 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/149753 | |
| dc.description.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. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TR-588 | |
| dc.title | Correctness Proof for a Network Synchronizer | en_US |
