scientific article; zbMATH DE number 177825

zbMATH Open0765.68152MaRDI QIDQ4038703FDOQ4038703

Authors: Mihalis Yannakakis, Costas Courcoubetis 

Publication date: 18 May 1993

Title of this publication is not available (Why is that?)

Recommendations

• Markov decision processes and regular events
• scientific article; zbMATH DE number 1786649
• On the complexity of finite memory policies for Markov decision processes
• scientific article; zbMATH DE number 4154239
• Markov decision processes

zbMATH Keywords

automata on infinite wordscontrolled Markov chains\(\omega\)- regular setsconcurrent probabilistic programsoptimal decision strategies for MDP

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited In (15)

• Regular decision processes
• Stochastic Müller Games are PSPACE-Complete
• Optimal schedulers vs optimal bases: an approach for efficient exact solving of Markov decision processes
• Spanning the spectrum from safety to liveness
• Markov decision processes and regular events
• The complexity of stochastic Müller games
• Submixing and shift-invariant stochastic games
• Temporal logics for the specification of performance and reliability
• Model checking linear-time properties of probabilistic systems
• Compositional probabilistic verification through multi-objective model checking
• Quantitative solution of omega-regular games
• Randomization in automata on infinite trees
• Synthesizing efficient controllers
• Converging from branching to linear metrics on Markov chains
• Symbolic control for stochastic systems via finite parity games

This page was built for publication:

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