Initial failures in distributed computations

Gadi Taubenfeld, Shmuel Katz, Shlomo Moran

Research output: Contribution to journalArticlepeer-review


We investigate the possibility of solving problems in completely asynchronous message passing systems where a number of processes may fail prior to execution. By using game-theoretical notions, necessary and sufficient conditions are provided for solving problems is such a model with an without a termination requirement. An upper bound on the message complexity for solving any problem in the model is given, as well as a simple design concept for constructing a solution to any solvable problem.

Original languageEnglish
Pages (from-to)255-276
Number of pages22
JournalInternational Journal of Parallel Programming
Issue number4
StatePublished - Aug 1989
Externally publishedYes


  • Asynchronous protocols
  • crash failures
  • initial failures
  • winning strategy


Dive into the research topics of 'Initial failures in distributed computations'. Together they form a unique fingerprint.

Cite this