Dicing on the Streett

DOI10.1016/J.IPL.2007.04.010zbMATH Open1184.68338OpenAlexW2084132452MaRDI QIDQ2379984FDOQ2379984

Authors: Florian Horn 

Publication date: 24 March 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2007.04.010

Recommendations

• Automata, Languages and Programming
• Strategy Improvement for Stochastic Rabin and Streett Games
• Partial-observation stochastic games: how to win when belief fails
• Concurrent games and semi-random determinacy
• Partial-observation stochastic games, how to win when belief fails

zbMATH Keywords

graph algorithmsmemorygamesrandomness

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Games involving graphs (91A43)

Cites Work

• On the synthesis of strategies in infinite games
• Automata, Languages and Programming
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computer Science Logic
• Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra

Cited In (4)

• Deciding Parity Games in Quasi-polynomial Time
• Stochastic Müller Games are PSPACE-Complete
• The complexity of stochastic Müller games
• Stochastic Games with Finitary Objectives

This page was built for publication: Dicing on the Streett

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