Finitary winning in -regular games
DOI10.1145/1614431.1614432zbMATH Open1351.68156OpenAlexW2015287249MaRDI QIDQ2946587FDOQ2946587
Authors: Krishnendu Chatterjee, Florian Horn, Thomas A. Henzinger 
Publication date: 17 September 2015
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1614431.1614432
Recommendations
Analysis of algorithms and problem complexity (68Q25) Games on graphs (graph-theoretic aspects) (05C57) Specification and verification (program logics, model checking, etc.) (68Q60)
Cited In (40)
- Optimal bounds in parametric LTL games
- Hierarchical cost-parity games
- Title not available (Why is that?)
- Prompt interval temporal logic
- Life is random, time is not: Markov decision processes with window objectives
- Characterizing positionality in games of Infinite duration over infinite graphs
- Game-theoretic semantics for \(\mathrm{ATL}^+\) with applications to model checking
- Timed games with bounded window parity objectives
- Alternating-time temporal logic ATL with finitely bounded semantics
- On promptness in parity games
- Concurrent games and semi-random determinacy
- Quantifying Bounds in Strategy Logic
- Solving parity games via priority promotion
- Delay games with WMSO+U winning conditions
- Improved algorithms for one-pair and \(k\)-pair Streett objectives
- Explicit Muller games are PTIME
- Graph games on ordinals
- Window parity games: an alternative approach toward parity games with time bounds
- Quantitative reductions and vertex-ranked infinite games
- Looking at mean-payoff and total-payoff through windows
- Deciding the Winner of an Arbitrary Finite Poset Game Is PSPACE-Complete
- On Reachability Games of Ordinal Length
- A delayed promotion policy for parity games
- Cycle detection in computation tree logic
- Tools and Algorithms for the Construction and Analysis of Systems
- Title not available (Why is that?)
- Stochastic window mean-payoff games
- Faster Algorithms for Finitary Games
- Stochastic Games with Finitary Objectives
- Down the Borel hierarchy: solving Muller games via safety games
- Title not available (Why is that?)
- Parameterized linear temporal logics meet costs: still not costlier than LTL
- Delay games with WMSO+U winning conditions
- Finitary languages
- Synthesizing optimally resilient controllers
- Parameterized linear temporal logics meet costs: still not costlier than LTL
- Title not available (Why is that?)
- Obliging games
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Finitary winning in \({\omega}\)-regular games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946587)
