M. Herlihy, Wait-free synchronization, ACM Transactions on Programming Languages and Systems, vol.13, issue.1, pp.124-149, 1991.
DOI : 10.1145/114005.102808

H. Attiya, A. Bar-noy, D. Dolev, D. Peleg, and R. Reischuk, Renaming in an asynchronous environment, Journal of the ACM, vol.37, issue.3, pp.524-548, 1990.
DOI : 10.1145/79147.79158

D. Alistarh, H. Attiya, S. Gilbert, A. Giurgiu, and R. Guerraoui, Fast randomized testand-set and renaming, Proceedings of the International Symposium on Distributed Computing (DISC), 2010.

Y. Afek, E. Gafni, J. Tromp, and P. Vitnyi, Wait-free test-and-set, Proceedings of the International Workshop on Distributed Algorithms (WDAG, now DISC), pp.85-94, 1992.
DOI : 10.1007/3-540-56188-9_6

E. Anceaume, F. Castella, A. Mostefaoui, and B. Sericola, A Message-Passing and Adaptive Implementation of the Randomized Test-and-Set Object, 2015 IEEE 14th International Symposium on Network Computing and Applications, 2015.
DOI : 10.1109/NCA.2015.27
URL : https://hal.archives-ouvertes.fr/hal-01075650

G. Giakkoupis and P. , On the time and space complexity of randomized test-and-set, Proceedings of the 2012 ACM symposium on Principles of distributed computing, PODC '12, pp.19-28, 2012.
DOI : 10.1145/2332432.2332436
URL : https://hal.archives-ouvertes.fr/hal-00722947

B. Sericola, Markov Chains: Theory, Algorithms and Applications, Iste Series, 2013.
DOI : 10.1002/9781118731543