@inproceedings{10.1007/978-3-030-45231-5_7,
    Abstract = {Bertrand et al. introduced a model of parameterised systems, where each agent is represented by a finite state system, and studied the following control problem: for any number of agents, does there exist a controller able to bring all agents to a target state? They showed that the problem is decidable and EXPTIME-complete in the adversarial setting, and posed as an open problem the stochastic setting, where the agent is represented by a Markov decision process. In this paper, we show that the stochastic control problem is decidable. Our solution makes significant uses of well quasi orders, of the max-flow min-cut theorem, and of the theory of regular cost functions.},
    Address = {Cham},
    Author = {Colcombet, Thomas and Fijalkow, Nathana{\"e}l and Ohlmann, Pierre},
    BookTitle = {Foundations of Software Science and Computation Structures},
    Editor = {Goubault-Larrecq, Jean and K{\"o}nig, Barbara},
    File = {Controlling a random population - Colcombet2020\_Chapter\_ControllingARandomPopulation - a - e.pdf},
    ISBN = {978-3-030-45231-5},
    Pages = {119--135},
    Publisher = {Springer International Publishing},
    Title = {Controlling a Random Population},
    Year = {2020},
    date-added = {2020-07-08 14:24:49 +0200},
    date-modified = {2020-07-08 14:24:49 +0200},
    doi = {10.1007/978-3-030-45231-5_7}
}

@inproceedings{10.1007/978-3-030-45231-5_7, Abstract = {Bertrand et al. introduced a model of parameterised systems, where each agent is represented by a finite state system, and studied the following control problem: for any number of agents, does there exist a controller able to bring all agents to a target state? They showed that the problem is decidable and EXPTIME-complete in the adversarial setting, and posed as an open problem the stochastic setting, where the agent is represented by a Markov decision process. In this paper, we show that the stochastic control problem is decidable. Our solution makes significant uses of well quasi orders, of the max-flow min-cut theorem, and of the theory of regular cost functions.}, Address = {Cham}, Author = {Colcombet, Thomas and Fijalkow, Nathana{\"e}l and Ohlmann, Pierre}, BookTitle = {Foundations of Software Science and Computation Structures}, Editor = {Goubault-Larrecq, Jean and K{\"o}nig, Barbara}, File = {Controlling a random population - Colcombet2020_Chapter_ControllingARandomPopulation - a - e.pdf}, ISBN = {978-3-030-45231-5}, Pages = {119--135}, Publisher = {Springer International Publishing}, Title = {Controlling a Random Population}, Year = {2020}, date-added = {2020-07-08 14:24:49 +0200}, date-modified = {2020-07-08 14:24:49 +0200}, doi = {10.1007/978-3-030-45231-5_7} }