Controlling a Random Population

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.

[1]  Krzysztof R. Apt,et al.  Lectures in Game Theory for Computer Scientists , 2011 .

[2]  A. Prasad Sistla,et al.  Reasoning about systems with many processes , 1992, JACM.

[3]  Rüdiger Valk,et al.  The residue of vector sets with applications to decidability problems in Petri nets , 1985, Acta Informatica.

[4]  D. R. Fulkerson,et al.  Maximal Flow Through a Network , 1956 .

[5]  Graham Higman,et al.  Ordering by Divisibility in Abstract Algebras , 1952 .

[6]  Thomas Colcombet,et al.  Regular Cost Functions, Part I: Logic and Algebra over Words , 2012, Log. Methods Comput. Sci..

[7]  François Fages,et al.  In silico control of biomolecular processes. , 2015, Methods in molecular biology.

[8]  Michael J. Fischer,et al.  Computation in networks of passively mobile finite-state sensors , 2004, PODC '04.

[9]  L. Dickson Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors , 1913 .

[10]  Sylvain Schmitz,et al.  Algorithmic Complexity of Well-Quasi-Orders , 2017 .

[11]  Hugo Gimbert,et al.  Probabilistic Automata on Finite Words: Decidable and Undecidable Problems , 2010, ICALP.

[12]  Wolfgang Thomas,et al.  Languages, Automata, and Logic , 1997, Handbook of Formal Languages.

[13]  Patrick Totzke,et al.  Controlling a Random Population is EXPTIME-hard , 2019, ArXiv.

[14]  Nathanaël Fijalkow,et al.  Undecidability results for probabilistic automata , 2017, SIGL.

[15]  Thomas Wilke,et al.  Automata Logics, and Infinite Games , 2002, Lecture Notes in Computer Science.

[16]  Antonín Kucera,et al.  Turn-based stochastic games , 2011, Lectures in Game Theory for Computer Scientists.

[17]  Hugo Gimbert,et al.  Controlling a Population , 2017, CONCUR.

[18]  Parosh Aziz Abdulla,et al.  Decisive Markov Chains , 2007, Log. Methods Comput. Sci..

[19]  Florian Horn,et al.  Two Recursively Inseparable Problems for Probabilistic Automata , 2014, MFCS.

[20]  Joseph B. Kruskal,et al.  The Theory of Well-Quasi-Ordering: A Frequently Discovered Concept , 1972, J. Comb. Theory A.

[21]  Javier Esparza,et al.  Parameterized Verification of Crowds of Anonymous Processes , 2016, Dependable Software Systems Engineering.

[22]  Alain Finkel,et al.  On the verification of broadcast protocols , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).