{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T17:05:57Z","timestamp":1780074357706,"version":"3.54.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662534250","type":"print"},{"value":"9783662534267","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-53426-7_14","type":"book-chapter","created":{"date-parts":[[2016,9,3]],"date-time":"2016-09-03T08:49:15Z","timestamp":1472892555000},"page":"187-200","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Certified Universal Gathering in $$\\mathbb {R} ^2$$ for Oblivious Mobile Robots"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Courtieu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lionel","family":"Rieg","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S\u00e9bastien","family":"Tixeuil","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xavier","family":"Urbain","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,9,4]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Adamek, J., Nesterenko, M., Tixeuil, S.: Evaluating and optimizing stabilizing dining philosophers. In: 11th European Dependable Computing Conference, EDCC 2015, Paris, France, September 7\u201311, pp. 233\u2013244. IEEE (2015)","DOI":"10.1109\/EDCC.2015.11"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-319-03089-0_13","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"C Auger","year":"2013","unstructured":"Auger, C., Bouzid, Z., Courtieu, P., Tixeuil, S., Urbain, X.: Certified impossibility results for byzantine-tolerant mobile robots. In: Higashino, T., Katayama, Y., Masuzawa, T., Potop-Butucaru, M., Yamashita, M. (eds.) SSS 2013. LNCS, vol. 8255, pp. 178\u2013190. Springer, Heidelberg (2013)"},{"key":"14_CR3","unstructured":"Berard, B., Millet, L., Potop-Butucaru, M., Thierry-Mieg, Y., Tixeuil, S.: Formal verification of Mobile Robot Protocols. Technical report, LIP6, LINCS, IUF, May 2013"},{"key":"14_CR4","series-title":"Coq\u2019Art: the calculus of inductive constructions","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07964-5","volume-title":"Interactive Theorem Proving and Program Development","author":"Y Bertot","year":"2004","unstructured":"Bertot, Y., Cast\u00e9ran, P.: Interactive Theorem Proving and Program Development. Coq\u2019Art: the calculus of inductive constructions. Springer, Heidelberg (2004)"},{"key":"14_CR5","unstructured":"Bonnet, F., D\u00e9fago, X., Petit, F., Potop-Butucaru, M., Tixeuil, S.: Discovering and assessing fine-grained metrics in robot networks protocols. In: 33rd IEEE International Symposium on Reliable Distributed Systems Workshops, SRDS Workshops 2014, Nara, Japan, October 6\u20139, 2014, pp. 50\u201359. IEEE (2014)"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Bouzid, Z., Das, S., Tixeuil, S.: Gathering of mobile robots tolerating multiple crash faults. In: ICDCS, pp. 337\u2013346. IEEE Computer Society, Philadelphia, Pennsylvania, USA, July 2013","DOI":"10.1109\/ICDCS.2013.27"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-319-25258-2_22","volume-title":"Structural Information and Communication Complexity","author":"Q Bramas","year":"2015","unstructured":"Bramas, Q., Tixeuil, S.: Wait-free gathering without chirality. In: Scheideler, C. (ed.) Structural Information and Communication Complexity. LNCS, vol. 9439, pp. 313\u2013327. Springer, Heidelberg (2015). doi: 10.1007\/978-3-319-25258-2_22"},{"issue":"3","key":"14_CR8","first-page":"101","volume":"7","author":"B B\u00e9rard","year":"2015","unstructured":"B\u00e9rard, B., Courtieu, P., Millet, L., Potop-Butucaru, M., Rieg, L., Sznajder, N., Tixeuil, S., Urbain, X., Methods, F.: Formal method for mobile robots: current results and open problems. Int. J. Inf. Soci. 7(3), 101\u2013114 (2015). Invited Paper","journal-title":"Int. J. Inf. Soci."},{"issue":"1","key":"14_CR9","first-page":"39","volume":"9","author":"P Cast\u00e9ran","year":"2011","unstructured":"Cast\u00e9ran, P., Filou, V.: Tasks, types and tactics for local computation systems. Stud. Inf. Univers. 9(1), 39\u201386 (2011)","journal-title":"Stud. Inf. Univers."},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/3-540-52335-9_47","volume-title":"COLOG-88","author":"T Coquand","year":"1990","unstructured":"Coquand, T., Paulin, C.: Inductively defined types. In: Martin-L\u00f6f, P., Mints, G. (eds.) COLOG-88. LNCS, vol. 417, pp. 50\u201356. Springer, Heidelberg (1990)"},{"key":"14_CR11","unstructured":"Courtieu, P., Rieg, L., Tixeuil, S., Urbain, X.: A Certified Universal Gathering Algorithm for Oblivious Mobile Robots. CoRR, abs\/1506.01603 (2015)"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/j.ipl.2014.11.001","volume":"115","author":"P Courtieu","year":"2015","unstructured":"Courtieu, P., Rieg, L., Tixeuil, S., Urbain, X.: Impossibility of gathering, a certification. Inf. Process. Lett. 115, 447\u2013452 (2015)","journal-title":"Inf. Process. Lett."},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1007\/978-3-642-33536-5_7","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"S Devismes","year":"2012","unstructured":"Devismes, S., Lamani, A., Petit, F., Raymond, P., Tixeuil, S.: Optimal grid exploration by asynchronous oblivious robots. In: Richa, A.W., Scheideler, C. (eds.) SSS 2012. LNCS, vol. 7596, pp. 64\u201376. Springer, Heidelberg (2012)"},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.tcs.2011.12.010","volume":"428","author":"Y Dieudonn\u00e9","year":"2012","unstructured":"Dieudonn\u00e9, Y., Petit, F.: Self-stabilizing gathering with strong multiplicity detection. Theor. Comput. Sci. 428, 47\u201357 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR15","series-title":"Synthesis Lectures on Distributed Computing Theory","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-02008-7","volume-title":"Distributed Computing by Oblivious Mobile Robots","author":"P Flocchini","year":"2012","unstructured":"Flocchini, P., Prencipe, G., Santoro, N.: Distributed Computing by Oblivious Mobile Robots. Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool Publishers, San Rafeal (2012)"},{"issue":"4","key":"14_CR16","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1109\/TPDS.2012.212","volume":"24","author":"T Izumi","year":"2013","unstructured":"Izumi, T., Izumi, T., Kamei, S., Ooshita, F.: Feasibility of polynomial-time randomized gathering for oblivious mobile robots. IEEE Trans. Parallel Distrib. Syst. 24(4), 716\u2013723 (2013)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"1","key":"14_CR17","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1137\/100797916","volume":"41","author":"T Izumi","year":"2012","unstructured":"Izumi, T., Souissi, S., Katayama, Y., Inuzuka, N., D\u00e9fago, X., Wada, K., Yamashita, M.: The gathering problem for two oblivious robots with unreliable compasses. SIAM J. Comput. 41(1), 26\u201346 (2012)","journal-title":"SIAM J. Comput."},{"key":"14_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/978-3-319-11764-5_17","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"L Millet","year":"2014","unstructured":"Millet, L., Potop-Butucaru, M., Sznajder, N., Tixeuil, S.: On the synthesis of mobile robots algorithms: the case of ring gathering. In: Felber, P., Garg, V. (eds.) SSS 2014. LNCS, vol. 8756, pp. 237\u2013251. Springer, Heidelberg (2014)"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Sangiorgi, D.: Introduction to Bisimulation and Coinduction. Cambridge University Press, Cambridge, UK (2012)","DOI":"10.1017\/CBO9780511777110"},{"issue":"4","key":"14_CR20","doi-asserted-by":"publisher","first-page":"1347","DOI":"10.1137\/S009753979628292X","volume":"28","author":"I Suzuki","year":"1999","unstructured":"Suzuki, I., Yamashita, M.: Distributed anonymous mobile robots: formation of geometric patterns. SIAM J. Comput. 28(4), 1347\u20131363 (1999)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53426-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,7]],"date-time":"2022-07-07T18:35:43Z","timestamp":1657218943000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53426-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662534250","9783662534267"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53426-7_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"4 September 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DISC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Distributed Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wdag2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}