Controlling a population
DOI10.4230/LIPICS.CONCUR.2017.12zbMATH Open1437.68175arXiv1707.02058MaRDI QIDQ5111624FDOQ5111624
Blaise Genest, Nathalie Bertrand, Hugo Gimbert, Miheer Dewaskar
Publication date: 27 May 2020
Full work available at URL: https://arxiv.org/abs/1707.02058
Recommendations
Formal languages and automata (68Q45) Applications of game theory (91A80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Specification and verification (program logics, model checking, etc.) (68Q60) Agent technology and artificial intelligence (68T42) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Multi-agent systems (93A16)
Cites Work
- Parameterised verification for multi-agent systems
- Reasoning about systems with many processes
- Synchronizing Automata and the Černý Conjecture
- Verification of Population Protocols
- Probabilistic Automata on Finite Words: Decidable and Undecidable Problems
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Title not available (Why is that?)
- Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time
- Games for synthesis of controllers with partial observation.
- Computation in networks of passively mobile finite-state sensors
- Keeping a Crowd Safe: On the Complexity of Parameterized Verification (Invited Talk).
- Playing with Probabilities in Reconfigurable Broadcast Networks
- Title not available (Why is that?)
- Model checking of systems with many identical timed processes
- On the Verification of Timed Ad Hoc Networks
- Title not available (Why is that?)
- Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata
- Reachability Games on Extended Vector Addition Systems with States
- Deciding parity games in quasipolynomial time
- Infinite Synchronizing Words for Probabilistic Automata
- Title not available (Why is that?)
- Limit Synchronization in Markov Decision Processes
Cited In (9)
- Expressive Power of Broadcast Consensus Protocols
- The complexity of synchronizing Markov decision processes
- Running time analysis of broadcast consensus protocols
- Title not available (Why is that?)
- Integral control for population management
- Stochastic games with synchronizing objectives
- Title not available (Why is that?)
- Bounds for synchronizing Markov decision processes
- Controlling a random population
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)
