Alysson Bessani,  Joni da Silva Fraga,  Lau Lung. 

The Bakery algorithm [Lamport, 1974] is a classical solution for the mutual exclusion problem in shared memory. This paper presents this algorithm adaptation for infinitely many processes that are subject to byzantine failures in a message passing communication system. This adaptation results in the byzantine bakery algorithm which is the first one for mutual exclusion that considers byzantine processes and guarantees that no process suffers starvation.

http://www.lbd.dcc.ufmg.br:8080/colecoes/sbrc/2005/055.pdf

Processando consulta.