{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T12:05:58Z","timestamp":1779451558496,"version":"3.53.1"},"reference-count":25,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T00:00:00Z","timestamp":1778803200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.tcs.2026.116013","type":"journal-article","created":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T23:28:01Z","timestamp":1778282881000},"page":"116013","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Deterministic color-optimal self-stabilizing semi-synchronous gathering: Two certified algorithms"],"prefix":"10.1016","volume":"1078","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6625-0035","authenticated-orcid":false,"given":"Fran\u00e7ois","family":"Bonnet","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0612-5616","authenticated-orcid":false,"given":"Quentin","family":"Bramas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8789-9781","authenticated-orcid":false,"given":"Pierre","family":"Courtieu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2377-205X","authenticated-orcid":false,"given":"Xavier","family":"D\u00e9fago","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-5751-3806","authenticated-orcid":false,"given":"Lionel","family":"Rieg","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0948-7172","authenticated-orcid":false,"given":"S\u00e9bastien","family":"Tixeuil","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7442-2538","authenticated-orcid":false,"given":"Xavier","family":"Urbain","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.tcs.2026.116013_bib0001","doi-asserted-by":"crossref","first-page":"1347","DOI":"10.1137\/S009753979628292X","article-title":"Distributed anonymous mobile robots: formation of geometric patterns","volume":"28","author":"Suzuki","year":"1999","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2026.116013_bib0002","doi-asserted-by":"crossref","unstructured":"S. Das, P. Flocchini, G. Prencipe, N. Santoro, M. Yamashita, Autonomous mobile robots with lights, Theor. Comput. Sci. 609(2016) 171\u2013184. 10.1016\/J.TCS.2015.09.018.","DOI":"10.1016\/j.tcs.2015.09.018"},{"issue":"11","key":"10.1016\/j.tcs.2026.116013_bib0003","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1145\/361179.361202","article-title":"Self-stabilizing systems in spite of distributed control","volume":"17","author":"Dijkstra","year":"1974","journal-title":"Commun. ACM"},{"key":"10.1016\/j.tcs.2026.116013_bib0004","doi-asserted-by":"crossref","unstructured":"Y. Dieudonn\u00e9, F. Petit, Self-stabilizing gathering with strong multiplicity detection, Theor. Comput. Sci. 428(2012) 47\u201357. 10.1016\/J.TCS.2011.12.010.","DOI":"10.1016\/j.tcs.2011.12.010"},{"issue":"5","key":"10.1016\/j.tcs.2026.116013_bib0005","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/s00446-019-00359-x","article-title":"Self-stabilizing gathering of mobile robots under crash or byzantine faults","volume":"33","author":"D\u00e9fago","year":"2020","journal-title":"Distribut. Comput."},{"key":"10.1016\/j.tcs.2026.116013_bib0006","series-title":"Stabilization, Safety, and Security of Distributed Systems - 25th International Symposium, SSS 2023, Jersey City, NJ, USA, October 2\u20134, 2023, Proceedings","first-page":"312","article-title":"Minimum algorithm sizes for self-stabilizing gathering and related problems of autonomous mobile robots (extended abstract)","volume":"14310","author":"Asahiro","year":"2023"},{"key":"10.1016\/j.tcs.2026.116013_bib0007","series-title":"Structural Information and Communication Complexity - 31st International Colloquium, SIROCCO 2024, Vietri sul Mare, Italy, May 27\u201329, 2024, Proceedings","first-page":"494","article-title":"Efficient self-stabilizing simulations of energy-restricted mobile robots by asynchronous luminous mobile robots","volume":"14662","author":"Nakajima","year":"2024"},{"key":"10.1016\/j.tcs.2026.116013_bib0008","series-title":"Distributed Computing by Mobile Entities","first-page":"63","article-title":"Gathering","volume":"11340","author":"Flocchini","year":"2019"},{"issue":"3","key":"10.1016\/j.tcs.2026.116013_bib0009","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/j.ipl.2014.11.001","article-title":"Impossibility of gathering, a certification","volume":"115","author":"Courtieu","year":"2015","journal-title":"Inf. Process. Lett."},{"issue":"2\u20133","key":"10.1016\/j.tcs.2026.116013_bib0010","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1016\/j.tcs.2007.04.023","article-title":"Impossibility of gathering by a set of autonomous mobile robots","volume":"384","author":"Prencipe","year":"2007","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"10.1016\/j.tcs.2026.116013_bib0011","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/s00224-017-9828-z","article-title":"Synchronous gathering without multiplicity detection: a certified algorithm","volume":"63","author":"Balabonski","year":"2019","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"10.1016\/j.tcs.2026.116013_bib0012","doi-asserted-by":"crossref","first-page":"829","DOI":"10.1137\/100796534","article-title":"Distributed computing by mobile robots: gathering","volume":"41","author":"Cieliebak","year":"2012","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2026.116013_bib0013","series-title":"Structural Information and Communication Complexity - 22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14\u201316, 2015, Post-Proceedings","first-page":"313","article-title":"Wait-free gathering without chirality","volume":"9439","author":"Bramas","year":"2015"},{"key":"10.1016\/j.tcs.2026.116013_bib0014","series-title":"Distributed Computing - 30th International Symposium, DISC 2016, Paris, France, September 27\u201329, 2016. Proceedings","first-page":"187","article-title":"Certified universal gathering in R2 for oblivious mobile robots","volume":"9888","author":"Courtieu","year":"2016"},{"key":"10.1016\/j.tcs.2026.116013_bib0015","series-title":"Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, ALGOSENSORS 2013, Sophia Antipolis, France, September 5\u20136, 2013, Revised Selected Papers","first-page":"291","article-title":"Rendezvous of two robots with visible bits","volume":"8243","author":"Viglietta","year":"2013"},{"key":"10.1016\/j.tcs.2026.116013_bib0016","doi-asserted-by":"crossref","unstructured":"X. D\u00e9fago, A. Heriban, S. Tixeuil, K. Wada, Using model checking to formally verify rendezvous algorithms for robots with lights in euclidean space, Robot. Auton. Syst. 163(2023) 104378. 10.1016\/J.ROBOT.2023.104378.","DOI":"10.1016\/j.robot.2023.104378"},{"key":"10.1016\/j.tcs.2026.116013_bib0017","doi-asserted-by":"crossref","unstructured":"S. Terai, K. Wada, Y. Katayama, Gathering problems for autonomous mobile robots with lights, Theor. Comput. Sci. 941(2023) 241\u2013261. 10.1016\/J.TCS.2022.11.018.","DOI":"10.1016\/j.tcs.2022.11.018"},{"key":"10.1016\/j.tcs.2026.116013_bib0018","doi-asserted-by":"crossref","unstructured":"B. B\u2019erard, P. Lafourcade, L. Millet, M. Potop-Butucaru, Y. Thierry-Mieg, S. Tixeuil, Formal verification of mobile robot protocols, Distribut. Comput. 29(6) (2016) 459\u2013487. 10.1007\/s00446-016-0271-1.","DOI":"10.1007\/s00446-016-0271-1"},{"key":"10.1016\/j.tcs.2026.116013_bib0019","series-title":"21st International Conference on Principles of Distributed Systems, OPODIS 2017, Lisbon, Portugal, December 18\u201320, 2017","first-page":"12:1","article-title":"Model checking of robot gathering","volume":"95","author":"Doan","year":"2017"},{"key":"10.1016\/j.tcs.2026.116013_bib0020","doi-asserted-by":"crossref","unstructured":"A. Sangnier, N. Sznajder, M. Potop-Butucaru, S. Tixeuil, Parameterized verification of algorithms for oblivious robots on a ring, Form. Method. Syst. Des. 56(1) (2020) 55\u201389. 10.1007\/S10703-019-00335-Y.","DOI":"10.1007\/s10703-019-00335-y"},{"key":"10.1016\/j.tcs.2026.116013_bib0021","unstructured":"A. Bauer, How to review formalized mathematics, 2013, (Blog post). http:\/\/math.andrej.com\/2013\/08\/19\/how-to-review-formalized-mathematics\/."},{"key":"10.1016\/j.tcs.2026.116013_bib0022","unstructured":"P. Courtieu, L. Rieg, S. Tixeuil, X. Urbain, Swarms of mobile robots: towards versatility with safety, Leibniz Trans. Embed. Syst.(2) (2022) 02:1\u201302:36. 10.4230\/LITES.8.2.2."},{"key":"10.1016\/j.tcs.2026.116013_bib0023","article-title":"Logical foundations","volume":"1","author":"Pierce","year":"2025"},{"key":"10.1016\/j.tcs.2026.116013_bib0024","series-title":"Texts in Theoretical Computer Science","article-title":"Interactive theorem proving and program development. Coq\u2019Art: the calculus of inductive constructions","author":"Bertot","year":"2004"},{"key":"10.1016\/j.tcs.2026.116013_bib0025","series-title":"Networked Systems - 7th International Conference, NETYS 2019, Marrakech, Morocco, June 19\u201321, 2019, Revised Selected Papers","first-page":"93","article-title":"Continuous vs. discrete asynchronous moves: a certified approach for mobile robots","volume":"11704","author":"Balabonski","year":"2019"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439752600263X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439752600263X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T11:13:34Z","timestamp":1779448414000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439752600263X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":25,"alternative-id":["S030439752600263X"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116013","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Deterministic color-optimal self-stabilizing semi-synchronous gathering: Two certified algorithms","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116013","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Authors. Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"116013"}}