{"id":"https://openalex.org/W7166825620","doi":"https://doi.org/10.4230/lipics.icalp.2026.167","title":"Population Protocols over Ordered Agents","display_name":"Population Protocols over Ordered Agents","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7166825620","doi":"https://doi.org/10.4230/lipics.icalp.2026.167"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26555","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.167","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.167/LIPIcs.ICALP.2026.167.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.167/LIPIcs.ICALP.2026.167.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032328924","display_name":"Michael Blondin","orcid":"https://orcid.org/0000-0003-2914-2734"},"institutions":[{"id":"https://openalex.org/I135117807","display_name":"Universit\u00e9 de Sherbrooke","ror":"https://ror.org/00kybxq39","country_code":"CA","type":"education","lineage":["https://openalex.org/I135117807"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Blondin, Michael","raw_affiliation_strings":["D\u00e9partement d'informatique, Universit\u00e9 de Sherbrooke, Canada"],"raw_orcid":"https://orcid.org/0000-0003-2914-2734","affiliations":[{"raw_affiliation_string":"D\u00e9partement d'informatique, Universit\u00e9 de Sherbrooke, Canada","institution_ids":["https://openalex.org/I135117807"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064763023","display_name":"Micha\u00ebl Cadilhac","orcid":"https://orcid.org/0000-0001-9828-9129"},"institutions":[{"id":"https://openalex.org/I118353179","display_name":"DePaul University","ror":"https://ror.org/04xtx5t16","country_code":"US","type":"education","lineage":["https://openalex.org/I118353179"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Cadilhac, Micha\u00ebl","raw_affiliation_strings":["DePaul University, Chicago, IL, USA"],"raw_orcid":"https://orcid.org/0000-0001-9828-9129","affiliations":[{"raw_affiliation_string":"DePaul University, Chicago, IL, USA","institution_ids":["https://openalex.org/I118353179"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5136055847","display_name":"Benjamin Courchesne","orcid":null},"institutions":[{"id":"https://openalex.org/I135117807","display_name":"Universit\u00e9 de Sherbrooke","ror":"https://ror.org/00kybxq39","country_code":"CA","type":"education","lineage":["https://openalex.org/I135117807"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Courchesne, Benjamin","raw_affiliation_strings":["D\u00e9partement d'informatique, Universit\u00e9 de Sherbrooke, Canada"],"raw_orcid":"https://orcid.org/0009-0001-8432-4736","affiliations":[{"raw_affiliation_string":"D\u00e9partement d'informatique, Universit\u00e9 de Sherbrooke, Canada","institution_ids":["https://openalex.org/I135117807"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060076079","display_name":"Lucie Guillou","orcid":"https://orcid.org/0000-0002-6101-2895"},"institutions":[{"id":"https://openalex.org/I4210121786","display_name":"Max Planck Institute for Software Systems","ror":"https://ror.org/02pe2kf23","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210121786"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Guillou, Lucie","raw_affiliation_strings":["MPI for Software Systems, Kaiserslautern, Germany"],"raw_orcid":"https://orcid.org/0000-0002-6101-2895","affiliations":[{"raw_affiliation_string":"MPI for Software Systems, Kaiserslautern, Germany","institution_ids":["https://openalex.org/I4210121786"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5135959496","display_name":"Corto Mascle","orcid":null},"institutions":[{"id":"https://openalex.org/I4210121786","display_name":"Max Planck Institute for Software Systems","ror":"https://ror.org/02pe2kf23","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210121786"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Mascle, Corto","raw_affiliation_strings":["MPI for Software Systems, Kaiserslautern, Germany"],"raw_orcid":"https://orcid.org/0009-0007-7976-7480","affiliations":[{"raw_affiliation_string":"MPI for Software Systems, Kaiserslautern, Germany","institution_ids":["https://openalex.org/I4210121786"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022262286","display_name":"Isa Vialard","orcid":"https://orcid.org/0000-0002-7261-9342"},"institutions":[{"id":"https://openalex.org/I4210121786","display_name":"Max Planck Institute for Software Systems","ror":"https://ror.org/02pe2kf23","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210121786"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Vialard, Isa","raw_affiliation_strings":["MPI for Software Systems, Saarbr\u00fccken, Germany"],"raw_orcid":"https://orcid.org/0000-0002-7261-9342","affiliations":[{"raw_affiliation_string":"MPI for Software Systems, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210121786"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.78925684,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9776999950408936,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9776999950408936,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.0035000001080334187,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12029","display_name":"DNA and Biological Computing","score":0.0027000000700354576,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.7612000107765198},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.7332000136375427},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.7084000110626221},{"id":"https://openalex.org/keywords/identifier","display_name":"Identifier","score":0.5379999876022339},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4239000082015991},{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.41370001435279846},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.40700000524520874},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.4047999978065491}],"concepts":[{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.7612000107765198},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.7332000136375427},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.7084000110626221},{"id":"https://openalex.org/C154504017","wikidata":"https://www.wikidata.org/wiki/Q853614","display_name":"Identifier","level":2,"score":0.5379999876022339},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5117999911308289},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.453900009393692},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4239000082015991},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.41370001435279846},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40950000286102295},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.40700000524520874},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.4047999978065491},{"id":"https://openalex.org/C75306776","wikidata":"https://www.wikidata.org/wiki/Q7632662","display_name":"Successor cardinal","level":2,"score":0.39879998564720154},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.35280001163482666},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.33739998936653137},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.32919999957084656},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.32100000977516174},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3147999942302704},{"id":"https://openalex.org/C41550386","wikidata":"https://www.wikidata.org/wiki/Q529909","display_name":"Multi-agent system","level":2,"score":0.3043000102043152},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.2791000008583069},{"id":"https://openalex.org/C190470478","wikidata":"https://www.wikidata.org/wiki/Q2370229","display_name":"Invariant (physics)","level":2,"score":0.2752000093460083},{"id":"https://openalex.org/C2780012671","wikidata":"https://www.wikidata.org/wiki/Q1343870","display_name":"Corollary","level":2,"score":0.26840001344680786},{"id":"https://openalex.org/C2776028153","wikidata":"https://www.wikidata.org/wiki/Q5953179","display_name":"Hybrid automaton","level":3,"score":0.2667999863624573}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26555","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.167","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.167/LIPIcs.ICALP.2026.167.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.icalp.2026.167","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.icalp.2026.167","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26555","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.167","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.167/LIPIcs.ICALP.2026.167.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7166825620.pdf","grobid_xml":"https://content.openalex.org/works/W7166825620.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Population":[0],"protocols":[1,123],"are":[2],"a":[3,9,26,42,59,131,188,208,228,235],"distributed":[4],"computation":[5,31],"model":[6,73,193],"in":[7,16,97,196,207],"which":[8,170],"collection":[10],"of":[11,38,67,94,133,148,211,225],"anonymous,":[12],"finite-state":[13],"agents":[14,78,86,107,126],"interact":[15,109],"randomly":[17],"chosen":[18],"pairs":[19],"and":[20,62,82,190,255],"update":[21],"their":[22,92],"states":[23],"according":[24],"to":[25,41,53,57,87,108,136,234],"fixed":[27],"transition":[28,138],"function.":[29],"The":[30],"is":[32,51,130,161,240,250],"defined":[33],"by":[34,76],"the":[35,39,46,112,117,144,166,203,223],"eventual":[36],"stabilization":[37],"population":[40,122,230,244],"consensus":[43],"that":[44,66,162,194,201,248],"represents":[45],"output.":[47],"In":[48],"practice,":[49],"it":[50,64],"natural":[52],"allow":[54],"each":[55],"agent":[56,69,153],"carry":[58],"unique":[60],"identifier":[61],"compare":[63],"with":[65],"another":[68],"before":[70,116],"interacting.":[71],"We":[72,120,140,185,198],"this":[74,238,249],"extension":[75],"having":[77],"be":[79,88],"totally":[80],"ordered":[81,125],"interactions":[83],"between":[84],"two":[85,106],"fireable":[89],"only":[90,110,151],"if":[91,111,202],"pair":[93],"identifiers":[95],"falls":[96],"some":[98],"condition":[99],"set.":[100],"For":[101],"instance,":[102],"PP[<]":[103,254],"allows":[104],"for":[105,242,253,260],"first":[113],"one":[114,152],"appears":[115,206],"second":[118],"one.":[119],"study":[121,142],"over":[124],"PP[\ud835\udca9]":[127,149,217],"where":[128,150],"\ud835\udca9":[129,210],"set":[132,209],"predicates":[134],"available":[135],"restrict":[137],"firing.":[139],"also":[141,186],"IO-PP[\ud835\udca9],":[143],"immediate":[145],"observation":[146],"fragment":[147],"changes":[154],"state":[155],"per":[156],"interaction.":[157],"Our":[158],"main":[159],"result":[160],"IO-PP[<]":[163],"recognizes":[164],"exactly":[165],"unambiguous":[167],"star-free":[168],"languages,":[169],"admits":[171],"many":[172],"other":[173],"characterizations,":[174],"such":[175],"as":[176],"two-variable":[177],"first-order":[178],"logic":[179,189],"or":[180],"two-way":[181],"deterministic":[182],"partially-ordered":[183],"automata.":[184],"provide":[187],"an":[191],"automaton":[192],"fits":[195],"PP[<].":[197],"further":[199],"show":[200,247],"successor":[204],"predicate":[205],"NSPACE(n)-computable":[212],"predicates,":[213],"then":[214],"IO-PP[\ud835\udca9]":[215],"=":[216,218],"NSPACE(n).":[219],"Finally,":[220],"we":[221,246],"investigate":[222],"problem":[224,239],"deciding":[226],"whether":[227],"given":[229],"protocol":[231],"always":[232],"stabilizes":[233],"consensus.":[236],"While":[237],"decidable":[241,259],"unordered":[243],"protocols,":[245],"undecidable":[251],"already":[252],"IO-PP[+1],":[256],"but":[257],"conditionally":[258],"IO-PP[<].":[261]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-02T00:00:00"}