Skip to Main content Skip to Navigation
Reports

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 :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00075290
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 5:53:07 PM
Last modification on : Thursday, February 11, 2021 - 2:48:03 PM
Long-term archiving on: : Tuesday, April 12, 2011 - 10:21:46 PM

Identifiers

  • HAL Id : inria-00075290, version 1

Citation

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

Share

Metrics

Record views

154

Files downloads

93