Synchronous distributed algoriths : a proof system - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1990

Synchronous distributed algoriths : a proof system

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.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-1269.pdf (726.78 Ko) Télécharger le fichier

Dates and versions

inria-00075290 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00075290 , version 1

Cite

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

Share

Gmail Facebook Twitter LinkedIn More