{"id":"https://openalex.org/W2963688871","doi":"https://doi.org/10.23919/fmcad.2017.8102262","title":"Parameterized verification of algorithms for oblivious robots on a ring","display_name":"Parameterized verification of algorithms for oblivious robots on a ring","publication_year":2017,"publication_date":"2017-10-01","ids":{"openalex":"https://openalex.org/W2963688871","doi":"https://doi.org/10.23919/fmcad.2017.8102262","mag":"2963688871"},"language":"en","primary_location":{"id":"doi:10.23919/fmcad.2017.8102262","is_oa":false,"landing_page_url":"https://doi.org/10.23919/fmcad.2017.8102262","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 Formal Methods in Computer Aided Design (FMCAD)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5040637644","display_name":"Arnaud Sangnier","orcid":"https://orcid.org/0000-0002-6731-0340"},"institutions":[{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]},{"id":"https://openalex.org/I169173203","display_name":"D\u00e9l\u00e9gation Paris 7","ror":"https://ror.org/00bw5n526","country_code":"FR","type":"government","lineage":["https://openalex.org/I154526488","https://openalex.org/I169173203"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Arnaud Sangnier","raw_affiliation_strings":["IRIF, Univ Paris Diderot"],"affiliations":[{"raw_affiliation_string":"IRIF, Univ Paris Diderot","institution_ids":["https://openalex.org/I169173203","https://openalex.org/I204730241"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028032477","display_name":"Nathalie Sznajder","orcid":"https://orcid.org/0000-0002-4199-2443"},"institutions":[{"id":"https://openalex.org/I169173203","display_name":"D\u00e9l\u00e9gation Paris 7","ror":"https://ror.org/00bw5n526","country_code":"FR","type":"government","lineage":["https://openalex.org/I154526488","https://openalex.org/I169173203"]},{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Nathalie Sznajder","raw_affiliation_strings":["IRIF, Univ Paris Diderot"],"affiliations":[{"raw_affiliation_string":"IRIF, Univ Paris Diderot","institution_ids":["https://openalex.org/I169173203","https://openalex.org/I204730241"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080217489","display_name":"Maria Potop-Butucaru","orcid":"https://orcid.org/0000-0001-6488-8326"},"institutions":[{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]},{"id":"https://openalex.org/I169173203","display_name":"D\u00e9l\u00e9gation Paris 7","ror":"https://ror.org/00bw5n526","country_code":"FR","type":"government","lineage":["https://openalex.org/I154526488","https://openalex.org/I169173203"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Maria Potop-Butucaru","raw_affiliation_strings":["IRIF, Univ Paris Diderot"],"affiliations":[{"raw_affiliation_string":"IRIF, Univ Paris Diderot","institution_ids":["https://openalex.org/I169173203","https://openalex.org/I204730241"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073883755","display_name":"S\u00e9bastien Tixeuil","orcid":"https://orcid.org/0000-0002-0948-7172"},"institutions":[{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]},{"id":"https://openalex.org/I169173203","display_name":"D\u00e9l\u00e9gation Paris 7","ror":"https://ror.org/00bw5n526","country_code":"FR","type":"government","lineage":["https://openalex.org/I154526488","https://openalex.org/I169173203"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Sebastien Tixeuil","raw_affiliation_strings":["IRIF, Univ Paris Diderot"],"affiliations":[{"raw_affiliation_string":"IRIF, Univ Paris Diderot","institution_ids":["https://openalex.org/I169173203","https://openalex.org/I204730241"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5040637644"],"corresponding_institution_ids":["https://openalex.org/I169173203","https://openalex.org/I204730241"],"apc_list":null,"apc_paid":null,"fwci":1.531,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.86289833,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"212","last_page":"219"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7788792848587036},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.7460864186286926},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6934767961502075},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.6784020662307739},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.6515434384346008},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.5867608189582825},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5458484292030334},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.5186152458190918},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.5122853517532349},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.4675627648830414},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.44981932640075684},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.4458155632019043},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4449048340320587},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.42004960775375366},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.17280948162078857},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15976545214653015}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7788792848587036},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.7460864186286926},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6934767961502075},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6784020662307739},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.6515434384346008},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.5867608189582825},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5458484292030334},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.5186152458190918},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.5122853517532349},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.4675627648830414},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.44981932640075684},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.4458155632019043},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4449048340320587},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.42004960775375366},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17280948162078857},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15976545214653015},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.23919/fmcad.2017.8102262","is_oa":false,"landing_page_url":"https://doi.org/10.23919/fmcad.2017.8102262","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 Formal Methods in Computer Aided Design (FMCAD)","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-01664894v1","is_oa":false,"landing_page_url":"https://hal.sorbonne-universite.fr/hal-01664894","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Formal Methods in Computer Aided Design, Oct 2017, Vienna, Austria. pp.212-219, ⟨10.23919/FMCAD.2017.8102262⟩","raw_type":"Conference papers"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.7099999785423279}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W179805188","https://openalex.org/W1494314796","https://openalex.org/W1662376798","https://openalex.org/W1750856813","https://openalex.org/W1973458874","https://openalex.org/W1981643246","https://openalex.org/W2020796742","https://openalex.org/W2062793829","https://openalex.org/W2082183470","https://openalex.org/W2147269402","https://openalex.org/W2160527279","https://openalex.org/W2264618208","https://openalex.org/W2338820189","https://openalex.org/W2538025500","https://openalex.org/W2963504389","https://openalex.org/W2998362756","https://openalex.org/W3182674124","https://openalex.org/W4211103781","https://openalex.org/W6695901225","https://openalex.org/W6736585104"],"related_works":["https://openalex.org/W2972379433","https://openalex.org/W1501430220","https://openalex.org/W2989332944","https://openalex.org/W2021891065","https://openalex.org/W2583549044","https://openalex.org/W2119045600","https://openalex.org/W2584984136","https://openalex.org/W1542027783","https://openalex.org/W2962928105","https://openalex.org/W2170336571"],"abstract_inverted_index":{"We":[0,121],"study":[1,110],"verification":[2,112],"problems":[3,127],"for":[4,59,130,156],"autonomous":[5],"swarms":[6],"of":[7,33,45,53,79,97,114,160,190,198],"mobile":[8],"robots":[9,35,131],"that":[10,123,140,182],"self-organize":[11],"and":[12,31,68,88,125],"cooperate":[13],"to":[14,85,94,100,109],"solve":[15],"global":[16],"objectives.":[17],"In":[18],"particular,":[19],"we":[20,138],"focus":[21],"in":[22,37,117,145,152,178],"this":[23],"paper":[24],"on":[25,164,175],"the":[26,95,107,111,118,135,146,153,165,196],"model":[27],"proposed":[28,57],"by":[29,186,195],"Suzuki":[30],"Yamashita":[32],"anonymous":[34],"evolving":[36,132],"a":[38,42,48,65,74,157],"discrete":[39],"space":[40],"with":[41],"finite":[43],"number":[44,52],"locations":[46],"(here,":[47],"ring).":[49],"A":[50],"large":[51],"algorithms":[54,81,116],"have":[55,82],"been":[56,83,92],"working":[58],"rings":[60],"whose":[61],"size":[62],"is":[63,106,193],"not":[64],"priori":[66],"fixed":[67],"can":[69,167,183],"be":[70,86,168,184],"hence":[71],"considered":[72],"as":[73,149,151,170],"parameter.":[75],"Handmade":[76],"correctness":[77],"proofs":[78],"these":[80],"shown":[84],"error-prone,":[87],"recent":[89],"attention":[90],"had":[91],"given":[93],"application":[96],"formal":[98],"methods":[99],"automatically":[101],"prove":[102],"those.":[103],"Our":[104],"work":[105],"first":[108],"problem":[113],"such":[115],"parameterized":[119],"case.":[120],"show":[122,139],"safety":[124,141],"reachability":[126],"are":[128,143],"undecidable":[129],"asynchronously.":[133],"On":[134],"positive":[136],"side,":[137],"properties":[142,163],"decidable":[144],"synchronous":[147],"case,":[148],"well":[150],"asynchronous":[154],"case":[155,200],"particular":[158],"class":[159],"algorithms.":[161],"Several":[162],"protocol":[166],"decided":[169],"well.":[171],"Decision":[172],"procedures":[173],"rely":[174],"an":[176,187],"encoding":[177,197],"Presburger":[179],"arithmetics":[180],"formulae":[181],"verified":[185],"SMT-solver.":[188],"Feasibility":[189],"our":[191],"approach":[192],"demonstrated":[194],"several":[199],"studies.":[201]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":2}],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2025-10-10T00:00:00"}