Author:
Colcombet Thomas,Fijalkow Nathanaël,Ohlmann Pierre
Abstract
AbstractBertrand 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.
Publisher
Springer International Publishing
Reference22 articles.
1. Abdulla, P.A., Henda, N.B., Mayr, R.: Decisive Markov chains. Logical Methods in Computer Science 3(4) (2007). https://doi.org/10.2168/LMCS-3(4:7)2007
2. Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. Distributed Computing 18(4), 235–253 (2006). https://doi.org/10.1007/s00446-005-0138-3
3. Bertrand, N., Dewaskar, M., Genest, B., Gimbert, H.: Controlling a population. In: CONCUR. pp. 12:1–12:16 (2017). https://doi.org/10.4230/LIPIcs.CONCUR.2017.12
4. Bertrand, N., Dewaskar, M., Genest, B., Gimbert, H., Godbole, A.A.: Controlling a population. Logical Methods in Computer Science 15(3) (2019), https://lmcs.episciences.org/5647
5. Colcombet, T.: Regular cost functions, part I: logic and algebra over words. Logical Methods in Computer Science 9(3) (2013). https://doi.org/10.2168/LMCS-9(3:3)2013
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Stochastic Games with Synchronization Objectives;Journal of the ACM;2023-05-23
2. Bounds for Synchronizing Markov Decision Processes;Computer Science – Theory and Applications;2022
3. Controlling a random population;Logical Methods in Computer Science;2021-11-24