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.

Highlights

  • The technical contribution of [3,4] is to prove that in the adversarial setting where an opponent chooses the evolution of the agents, the control problem is EXPTIME-complete

  • We study the stochastic setting, where each agent evolves independently according to a probabilistic distribution, i.e. the finite state system modelling an agent is a Markov decision process

  • We showed the decidability of the stochastic control problem

Read more

Summary

Introduction

The control problem for populations of identical agents. The model we study was introduced in [3] (see the journal version [4]): a population of agents are controlled uniformly, meaning that the controller applies the same action to every agent. We study the stochastic setting, where each agent evolves independently according to a probabilistic distribution, i.e. the finite state system modelling an agent is a Markov decision process. As discussed in the conclusions of [3,4], the stochastic semantics is more satisfactory than the adversarial one for representing the behaviours of the chemical reactions, so our decidability result is a step towards a better understanding of the modelling of biological systems as populations of arbitrarily many agents represented by finite state systems. The first and most widely studied is population protocols, introduced in [2]: the agents are modelled by finite state systems and interact by pairs drawn at random. As explained in [3,4], our model can be seen as a subclass of (stochastic) broadcast protocols, but key differences exist in the semantics, making the two bodies of work technically independent.

The stochastic control problem
The sequential flow problem
Reduction of the stochastic control problem to the sequential flow problem
Computability of the sequential flow problem
Conclusions

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.