Correctness Proof for a Network Synchronizer

Thumbnail Image
Download
Name

MIT-LCS-TR-588.pdf

Size

1.74 MB

Format

Adobe PDF

Checksum (MD5)

5cfb61c935c26e54eea8e29989f5933f

Author(s)
Devarajan, Harish
•
Fekete, Alan
•
Lynch, Nancy A.
•
Shrira, Liuba
Date Issued
December 1993
Series/Report no.
MIT-LCS-TR-588
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.
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.