The computational structure of progress conditions

Gadi Taubenfeld

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


Understanding the effect of different progress conditions on the computability of distributed systems is an important and exciting research direction. For a system with n processes, we define exponentially many new progress conditions and explore their properties and strength. We cover all the known, symmetric and asymmetric, progress conditions and many new interesting conditions. Together with our technical results, the new definitions provide a deeper understanding of synchronization and concurrency.

Original languageEnglish
Title of host publicationDistributed Computing - 24th International Symposium, DISC 2010, Proceedings
Number of pages15
StatePublished - 2010
Externally publishedYes
Event24th International Symposium on Distributed Computing, DISC 2010 - Cambridge, MA, United States
Duration: 13 Sep 201015 Sep 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6343 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference24th International Symposium on Distributed Computing, DISC 2010
Country/TerritoryUnited States
CityCambridge, MA


  • Progress conditions
  • S-freedom
  • consensus
  • contention
  • cooperation
  • hierarchy
  • obstruction-freedom
  • synchronization
  • universality
  • wait-freedom


Dive into the research topics of 'The computational structure of progress conditions'. Together they form a unique fingerprint.

Cite this