{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:38:45Z","timestamp":1753889925207,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2019,7,29]],"date-time":"2019-07-29T00:00:00Z","timestamp":1564358400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,7,29]],"date-time":"2019-07-29T00:00:00Z","timestamp":1564358400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,7,29]],"date-time":"2019-07-29T00:00:00Z","timestamp":1564358400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001665","name":"French National Research Agency","doi-asserted-by":"crossref","award":["ANR-13-BS02-0011"],"award-info":[{"award-number":["ANR-13-BS02-0011"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"accepted":{"date-parts":[[2025,3,31]]},"abstract":"<jats:p>We introduce a new setting where a population of agents, each modelled by a finite-state system, are controlled uniformly: the controller applies the same action to every agent. The framework is largely inspired by the control of a biological system, namely a population of yeasts, where the controller may only change the environment common to all cells. We study a synchronisation problem for such populations: no matter how individual agents react to the actions of the controller, the controller aims at driving all agents synchronously to a target state. The agents are naturally represented by a non-deterministic finite state automaton (NFA), the same for every agent, and the whole system is encoded as a 2-player game. The first player (Controller) chooses actions, and the second player (Agents) resolves non-determinism for each agent. The game with m agents is called the m -population game. This gives rise to a parameterized control problem (where control refers to 2 player games), namely the population control problem: can Controller control the m-population game for all m in N whatever Agents does?<\/jats:p><jats:p>Comment: This is a journal version of the extended abstract arXiv:1707.02058   which appeared in Concur 2017, together with proofs<\/jats:p>","DOI":"10.23638\/lmcs-15(3:6)2019","type":"journal-article","created":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T17:37:46Z","timestamp":1743701866000},"source":"Crossref","is-referenced-by-count":0,"title":["Controlling a population"],"prefix":"10.23638","volume":"Volume 15, Issue 3","author":[{"given":"Nathalie","family":"Bertrand","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7672-2531","authenticated-orcid":false,"given":"Miheer","family":"Dewaskar","sequence":"additional","affiliation":[]},{"given":"Blaise","family":"Genest","sequence":"additional","affiliation":[]},{"given":"Hugo","family":"Gimbert","sequence":"additional","affiliation":[]},{"given":"Adwait Amit","family":"Godbole","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2019,7,29]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/arxiv.org\/pdf\/1807.00893v3","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/arxiv.org\/pdf\/1807.00893v3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T17:37:46Z","timestamp":1743701866000},"score":1,"resource":{"primary":{"URL":"http:\/\/lmcs.episciences.org\/4662"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,29]]},"references-count":0,"URL":"https:\/\/doi.org\/10.23638\/lmcs-15(3:6)2019","relation":{"has-preprint":[{"id-type":"arxiv","id":"1807.00893v2","asserted-by":"subject"},{"id-type":"arxiv","id":"1807.00893v1","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"1807.00893","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1807.00893","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2019,7,29]]},"article-number":"4662"}}