Bounds for synchronizing Markov decision processes

DOI10.1007/978-3-031-09574-0_9MaRDI QIDQ2097220zbMATH OpenOpenAlexFDO

Authors Laurent Doyen, Marie van den Bogaard

Publication date 11 November 2022

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

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A note on emptiness for alternating finite automata with a one-letter alphabet
• A survey of stochastic -regular games
• Computation tree logic for synchronization properties
• Controlling a population
• Controlling a random population
• Decidability of Cutpoint Isolation for Probabilistic Finite Automata on Letter-Bounded Inputs.
• Distribution-based objectives for Markov decision processes
• Handbook of Markov decision processes. Methods and applications
• scientific article; zbMATH DE number 700091 (Why is no real title available?)
• scientific article; zbMATH DE number 1948170 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• Probabilistic automata
• Probabilistic Bisimulation: Naturally on Distributions
• Stochastic processes. Theory for applications.
• The complexity of probabilistic verification
• The complexity of synchronizing Markov decision processes

Cited in

(1)

• Robust Synchronization in Markov Decision Processes

This page was built for publication: Bounds for synchronizing Markov decision processes

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