scientific article; zbMATH DE number 7439736
From MaRDI portal
Publication:5015274
zbMath1478.91036arXiv1606.01831MaRDI QIDQ5015274
Véronique Bruyère, Quentin Hautem, Mickael Randour
Publication date: 7 December 2021
Full work available at URL: https://arxiv.org/abs/1606.01831
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (10)
Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Quantitative reductions and vertex-ranked infinite games ⋮ Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions ⋮ Unnamed Item ⋮ Timed games with bounded window parity objectives
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- From liveness to promptness
- Number of quantifiers is better than number of tape cells
- Borel determinacy
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Automata, logics, and infinite games. A guide to current research
- Strategy synthesis for multi-dimensional quantitative objectives
- Looking at mean-payoff and total-payoff through windows
- Finitary winning in ω-regular games
- Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition
- A Deterministic Subexponential Algorithm for Solving Parity Games
- Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications
- On the menbership problem for functional and multivalued dependencies in relational databases
- Alternation
- Weight monitoring with linear temporal logic
- Solving Parity Games in Big Steps
- Parity and Streett Games with Costs
- Generalized Parity Games
This page was built for publication:
