Controlling a random population

DOI10.1007/978-3-030-45231-5_7MaRDI QIDQ2200817zbMATH OpenOpenAlexFDO

Authors Thomas Colcombet, Nathanaël Fijalkow, Pierre Ohlmann

Publication date 23 September 2020

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-030-45231-5_7

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Recommendations

• Controlling a random population
• Controlling a population
• Controlling a population
• Stochastic models of mob control
• scientific article; zbMATH DE number 2163041

Cites work

• Automata, logics, and infinite games. A guide to current research
• Computation in networks of passively mobile finite-state sensors
• Controlling a population
• Controlling a population
• Decisive Markov Chains
• Maximal Flow Through a Network
• Ordering by Divisibility in Abstract Algebras
• Probabilistic automata on finite words: decidable and undecidable problems
• Reasoning about systems with many processes
• Regular cost functions. I: Logic and algebra over words
• The residue of vector sets with applications to decidability problems in Petri nets
• The theory of well-quasi-ordering: a frequently discovered concept
• Turn-based stochastic games
• Two recursively inseparable problems for probabilistic automata

Cited in

(3)

• scientific article; zbMATH DE number 7471672 (Why is no real title available?)
• Stochastic games with synchronizing objectives
• Bounds for synchronizing Markov decision processes

This page was built for publication: Controlling a random population

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