Dicing on the Streett

Authors:
Florian Horn
Affiliations:
LIAFA, Université Paris 7, Case 7014, 2 place Jussieu, F-75251 Paris 5, France and Lehrstuhl für Informatik VII, RWTH, Ahornstraße 55, 52056 Aachen, Germany
Venue:
Information Processing Letters
Year:
2007

Citing 10
Cited 2

Simulating alternating tree automata by nondeterministic automata: new results and new proofs of the theorems of Rabin, McNaughton and Safra

Theoretical Computer Science
Weak alternating automata and tree automata emptiness

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Infinite games on finitely coloured graphs with applications to automata on infinite trees

Theoretical Computer Science
Strategy Construction in Infinite Ganes with Streett and Rabin Chain Winning Conditions

TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
How much memory is needed to win infinite games?

LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Concurrent Omega-Regular Games

LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Trading Memory for Randomness

QEST '04 Proceedings of the The Quantitative Evaluation of Systems, First International Conference
Faster Solutions of Rabin and Streett Games

LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
The complexity of tree automata and logics of programs

SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
The complexity of stochastic rabin and streett games

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming

Stochastic Müller games are PSPACE-complete

FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
The complexity of stochastic Müller games

Information and Computation

Quantified Score

Hi-index	0.89

Visualization

Abstract

Streett/Rabin games are an adequate model of strong fairness in reactive systems. We show here some results about their stochastic version. We extend the known lower bound in memory for the pure winning strategies of the Streett player to randomized strategies. We also propose algorithms computing the almost sure winning regions of both players in stochastic Streett/Rabin games. The Rabin algorithm also yields directly a pure memoryless almost-sure winning strategy.