Strategy construction in infinite games with Streett and Rabin chain winning conditions
- 1 January 1996
- book chapter
- Published by Springer Nature
- p. 207-224
- https://doi.org/10.1007/3-540-61042-1_46
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Tree automata, mu-calculus and determinacyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and SafraTheoretical Computer Science, 1995
- Modeling and Control of Logical Discrete Event SystemsPublished by Springer Nature ,1995
- Infinite games played on finite graphsAnnals of Pure and Applied Logic, 1993
- Concurrent Programs as Strategies in GamesPublished by Springer Nature ,1992
- The control of discrete event systemsProceedings of the IEEE, 1989
- State-strategies for games in Fσδ ∩ GδσThe Journal of Symbolic Logic, 1983
- Propositional dynamic logic of looping and converse is elementarily decidableInformation and Control, 1982
- Trees, automata, and gamesPublished by Association for Computing Machinery (ACM) ,1982
- Solving sequential conditions by finite-state strategiesTransactions of the American Mathematical Society, 1969