A distributed self-stabilizing solution to the dining philosophers problem (Q1190517)

We will describe a self-stabilizing dining philosophers algorithm. Our work was inspired by the self-stabilizing dining philosophers algorithm presented by \textit{M. G. Gouda} [The stabilizing philosopher: asymmetry by memory and by action, Tech. Rept. TR-87-12, University of Texas at Austin (1987)]. In Gouda's solution, one of the philosophers is required to behave differently than the others in order to introduce asymmetry. In our solution, asymmetry is introduced by the token circling the ring of philosophers; our philosophers all execute exactly the same algorithm. Only the token system requires asymmetry. This layering is very similar to the idea of protocol superimposition as described by \textit{S. Katz} and \textit{K. J. Perry} [Distrib. Comput. 7, No. 1, 17--26 (1993; Zbl 1282.68077)]. The layering approach simplifies the transitions required by the philosophers versus those required by \textit{Gouda}.