Window parity games: an alternative approach toward parity games with time bounds
From MaRDI portal
(Redirected from Publication:5015274)
Recommendations
Cites work
- A Deterministic Subexponential Algorithm for Solving Parity Games
- Alternation
- Automata, logics, and infinite games. A guide to current research
- Borel determinacy
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- Easy to win, hard to master: optimal strategies in parity games with costs
- Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition
- Finitary winning in \({\omega}\)-regular games
- From liveness to promptness
- Generalized Parity Games
- scientific article; zbMATH DE number 1500523 (Why is no real title available?)
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Infinite-state games with finitary conditions
- Looking at mean-payoff and total-payoff through windows
- Number of quantifiers is better than number of tape cells
- On the menbership problem for functional and multivalued dependencies in relational databases
- Parity and Streett games with costs
- Solving Parity Games in Big Steps
- Symbolic synthesis of finite-state controllers for request-response specifications
- Weight monitoring with linear temporal logic
Cited in
(16)- Quantitative reductions and vertex-ranked infinite games
- Timed games with bounded window parity objectives
- On promptness in parity games
- Quantitative reductions and vertex-ranked infinite games
- Concurrent games and semi-random determinacy
- Games where you can play optimally with arena-independent finite memory
- scientific article; zbMATH DE number 7559480 (Why is no real title available?)
- Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions
- Life is random, time is not: Markov decision processes with window objectives
- Life is random, time is not: Markov decision processes with window objectives
- Half-positional objectives recognized by deterministic Büchi automata
- Stochastic window mean-payoff games
- Different strokes in randomised strategies: revisiting Kuhn's theorem under finite-memory assumptions
- Stochastic window mean-payoff games
- Promptness and fairness in Muller LTL formulas
- Simplicity lies in the eye of the beholder: a strategic perspective on controllers in reactive synthesis
This page was built for publication: Window parity games: an alternative approach toward parity games with time bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5015274)
