HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Synchronous distributed algoriths : a proof system

Michel Adam 1 Jean-Michel Hélary 1
1 ADP - Distributed Algorithms and Protocols
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, INRIA Rennes
Abstract : Simulating synchronism on asynchronous networks allows to design synchronous distributed algorithms. This design relies upon a language with a clear operationnal semantic and an assertional proof system, consistent and complete. As an illustration, a synchronous election algorithm on an arbitrary topology network is formally derived and proved.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 5:53:07 PM
Last modification on : Friday, February 4, 2022 - 3:24:03 AM
Long-term archiving on: : Tuesday, April 12, 2011 - 10:21:46 PM


  • HAL Id : inria-00075290, version 1


Michel Adam, Jean-Michel Hélary. Synchronous distributed algoriths : a proof system. [Research Report] RR-1269, INRIA. 1990. ⟨inria-00075290⟩



Record views


Files downloads