Analyze of Probabilistic Algorithms under Indeterministic Scheduler

@article{Beauquier2008AnalyzeOP,
  title={Analyze of Probabilistic Algorithms under Indeterministic Scheduler},
  author={Joffroy Beauquier and Colette Johnen},
  journal={2008 IEEE International Symposium on Parallel and Distributed Processing with Applications},
  year={2008},
  pages={553-558}
}
In a distributed system, the environment is described by the scheduler (also called adversary or demon). Through an example related to stabilization, we show that a formal proof that does not use a formal definition of a scheduler is pointless. As a matter of fact, we show that the same algorithm, according to the scheduler, can be either correct or… CONTINUE READING