? k ) such that ? k (q).status = In and ?p ? P F ree (? k ) ? CN t, p.p / ? {q} ? CN q ,
Let e = (? j ) j?0 be an execution of LRA ? T C and let i ? 0 such that T C has stabilized in ? i . Let t ? V be the unique tokenholder in ? i Assume that R(e, i, 6) exists ,
Then, by hypothesis, t.req = ? holds in all configurations between ? R(e,i,2) and ? R(e,i,6) . Moreover, RsT -action is disabled at t in all configurations between ? R(e,i,2) and ? R(e,i,6) , by Claim 1. Hence, t sets t.status to Wait by R-action within two rounds from ,
Let i ? 0 such that T C has stabilized at ? i Assume that R(e, i, 6n(N tok + 1)) exists and R(e, i, 6n(N tok + 1)) ? M (e, i) Similarly to the proof of Lemma 14, P F ree cannot increase, hence if it is empty at some configuration ? k with k ? {R(e, i, 6n(N tok + 1)), . . . , M (e, i)}, we are done, Proof. Let e =)), . . . , M (e, i)}. Assume P F ree (? k ) = ? and let p ? P F ree, p.6 ,
No Livelock property of strong concurrency: there exists a number of rounds T P C > 0 such that for every execution e = (? i ) i?0 and for every index i ? 0 ,
N tok + 1) + 4n ? 4 Let e = (? i ) i?0 be an execution of LRA ? T C and let i ? 0 Assume that R(e, i, T P C ) exists and R(e, i, T P C ) ? M (e, i) After T tok rounds, T C has stabilized, Using Lemma, vol.15 ,
N tok + 1), P F ree is empty and remains so until M (e, i) ,
i) ? 1}, P assT oken is not executed in step ? k ? ? k+1 . Note that this implies that P assT oken is not executed during the last 6 rounds by the tokenholder t: this allows to apply Lemma 13: there exists a conflicting neighbor of t, q, such that ?p ? P F ree ? CN t, p.p / ? {q} ? CN q ,
Self-stabilizing Leader Election in Polynomial Steps, Stabilization, Safety, and Security of Distributed Systems -16th International Symposium, SSS 2014. Proceedings, pp.106-119, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-01347471
On Probabilistic Snap-Stabilization, ICDCN'2014, 15th International Conference on Distributed Computing and Networking, pp.272-286, 2014. ,
Distributed reset, IEEE Transactions on Computers, vol.43, issue.9, pp.1026-1038, 1994. ,
DOI : 10.1109/12.312126
Snap-Stabilizing Comittee Coordination, 25th IEEE International Symposium on Parallel and Distributed Processing IPDPS 2011Conference Proceedings, pp.231-242, 2011. ,
DOI : 10.1109/ipdps.2011.31
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.650.9137
When graph theory helps self-stabilization, Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing , PODC '04, pp.150-159, 2004. ,
DOI : 10.1145/1011767.1011790
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.79.2190
Snap-stabilization and PIF in tree networks, Distributed Computing, vol.29, issue.1, pp.3-19, 2007. ,
DOI : 10.1007/s00446-007-0030-4
Self-Stabilizing Atomicity Refinement Allowing Neighborhood Concurrency, Self-Stabilizing Systems, 6th International Symposium, SSS 2003 Proceedings, pp.102-112, 2003. ,
DOI : 10.1007/3-540-45032-7_8
Light enabling snap-stabilization of fundamental protocols, ACM Transactions on Autonomous and Adaptive Systems, vol.4, issue.1, 2009. ,
DOI : 10.1145/1462187.1462193
A Self-Stabilizing Token-Based kout-of-l-Exclusion Algorithm. Concurrency and Computation: Practice and Experience, pp.11-121069, 2003. ,
A new self-stabilizing k-out-of-l exclusion algorithm on rings, Self-Stabilizing Systems, 6th International Symposium, SSS 2003 Proceedings, pp.113-128, 2003. ,
Self-Stabilizing Depth-First Token Circulation in Arbitrary Rooted Networks, Distributed Computing, pp.207-218, 2000. ,
Self-stabilizing leader election in optimal space under an arbitrary scheduler, Theoretical Computer Science, vol.412, issue.40, pp.5541-5561, 2011. ,
DOI : 10.1016/j.tcs.2010.05.001
Solution of a Problem in Concurrent Programming Control, Commun ,
Self-stabilizing systems in spite of distributed control, Commun ,
Two Starvation-Free Solutions of a General Exclusion Problem, 1978. ,
Self Stabilization, Journal of Aerospace Computing, Information, and Communication, vol.1, issue.6, 2000. ,
DOI : 10.2514/1.10141
URL : https://hal.archives-ouvertes.fr/inria-00627780
SuperStabilizing protocols for dynamic distributed systems, Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing , PODC '95, 1997. ,
DOI : 10.1145/224964.224993
Uniform dynamic self-stabilizing leader election, IEEE Transactions on Parallel and Distributed Systems, vol.8, issue.4, pp.424-440, 1997. ,
DOI : 10.1109/71.588622
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.124.7453
Resource Allocation with Immunity to Limited Process Failure (Preliminary Report), 20th Annual Symposium on Foundations of Computer Science, pp.29-31, 1979. ,
The Alternator. Distributed Computing, pp.21-28, 2007. ,
Conflict Managers for Self-stabilization without Fairness Assumption, 27th International Conference on Distributed Computing Systems (ICDCS '07), p.46, 2007. ,
DOI : 10.1109/ICDCS.2007.95
URL : https://hal.archives-ouvertes.fr/hal-01336216
The Fuzzy Philosophers, Parallel and Distributed Processing Proceedings, pp.130-136, 2000. ,
Self-Stabilizing Depth-First Token Circulation on Networks, Distributed Computing, vol.7, issue.1, pp.61-66, 1993. ,
A new solution of Dijkstra's concurrent programming problem, Communications of the ACM, vol.17, issue.8, pp.453-455, 1974. ,
DOI : 10.1145/361082.361093
Stabilization-Preserving Atomicity Refinement, Journal of Parallel and Distributed Computing, vol.62, issue.5, pp.766-791, 2002. ,
DOI : 10.1006/jpdc.2001.1828
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.5619
A distributed solution to the k-out of-M resources allocation problem, Advances in Computing and Information -ICCI'91, International Conference on Computing and Information Proceedings, pp.599-609, 1991. ,
DOI : 10.1007/3-540-54029-6_209
URL : https://hal.archives-ouvertes.fr/inria-00075199