Controlling a Population

Abstract : 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 ∈ N whatever Agents does? In this paper, we prove that the population control problem is decidable, and it is a EXPTIME-complete problem. As far as we know, this is one of the first results on parameterized control. Our algorithm, not based on cutoff techniques, produces winning strategies which are symbolic, that is, they do not need to count precisely how the population is spread between states. We also show that if there is no winning strategy, then there is a population size M such that Controller wins the m-population game if and only if m $≤ M$ . Surprisingly, M can be doubly exponential in the number of states of the NFA, with tight upper and lower bounds.
Type de document :
Communication dans un congrès
CONCUR 2017 - 28th International Conference on Concurrency Theory, Sep 2017, Berlin, Germany. pp.12:1-12:16, 2017
Liste complète des métadonnées

Littérature citée [19 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01625661
Contributeur : Blaise Genest <>
Soumis le : samedi 28 octobre 2017 - 09:32:10
Dernière modification le : lundi 11 février 2019 - 16:36:40
Document(s) archivé(s) le : lundi 29 janvier 2018 - 14:35:14

Fichier

BDGG17.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01625661, version 1

Citation

Nathalie Bertrand, Miheer Dewaskar, Blaise Genest, Hugo Gimbert. Controlling a Population. CONCUR 2017 - 28th International Conference on Concurrency Theory, Sep 2017, Berlin, Germany. pp.12:1-12:16, 2017. 〈hal-01625661〉

Partager

Métriques

Consultations de la notice

443

Téléchargements de fichiers

29