Controlling a population

DOI10.4230/LIPICS.CONCUR.2017.12MaRDI QIDQ5111624zbMATH OpenFDO

Authors Nathalie Bertrand, Miheer Dewaskar, Blaise Genest, Hugo Gimbert

Publication date 27 May 2020

Full work available at URL https://arxiv.org/abs/1707.02058

zbMATH Keywords

controlmodel-checkingparametric systems

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Agent technology and artificial intelligence (68T42) Applications of game theory (91A80) Multi-agent systems (93A16)

Recommendations

• Controlling a population
• Playing with population protocols
• Population stability. Regulating size in the presence of an adversary
• On the control of asynchronous automata
• Control problems of a discrete hierarchical population system

Cites work

• Computation in networks of passively mobile finite-state sensors
• Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata
• Controlling a population
• Deciding parity games in quasipolynomial time
• Fixed-dimensional energy games are in pseudo-polynomial time
• Games for synthesis of controllers with partial observation.
• scientific article; zbMATH DE number 1500523 (Why is no real title available?)
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Infinite Synchronizing Words for Probabilistic Automata
• Keeping a crowd safe: on the complexity of parameterized verification (invited talk)
• Limit synchronization in Markov decision processes
• Model checking of systems with many identical timed processes
• On regularity of unary probabilistic automata
• On the Verification of Timed Ad Hoc Networks
• Parameterised verification for multi-agent systems
• Parameterized verification of many identical probabilistic timed processes
• Playing with probabilities in reconfigurable broadcast networks
• Probabilistic automata on finite words: decidable and undecidable problems
• Reachability games on extended vector addition systems with states
• Reasoning about systems with many processes
• Synchronizing Automata and the Černý Conjecture
• Verification of Population Protocols

Cited in

(11)

• The complexity of synchronizing Markov decision processes
• Bounds for synchronizing Markov decision processes
• Controlling a random population
• Running time analysis of broadcast consensus protocols
• Integral control for population management
• Controlling a random population
• Controlling a population
• Controlling a population
• Expressive Power of Broadcast Consensus Protocols
• Stochastic games with synchronizing objectives
• Stochastic games with synchronization objectives

This page was built for publication: Controlling a population

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111624)