Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions
From MaRDI portal
Publication:5090979
DOI10.4230/LIPIcs.FSTTCS.2018.38OpenAlexW2963055215MaRDI QIDQ5090979
Mickael Randour, Stéphane Le Roux, Arno Pauly
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1808.05791
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)
Related Items (5)
Synthesis for Multi-weighted Games with Branching-Time Winning Conditions ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Timed games with bounded window parity objectives
Cites Work
- Unnamed Item
- Positional strategies for mean payoff games
- Borel determinacy
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Extending finite-memory determinacy to multi-player games
- Energy parity games
- Automata, logics, and infinite games. A guide to current research
- Strategy synthesis for multi-dimensional quantitative objectives
- The complexity of multi-mean-payoff and multi-energy games
- Looking at mean-payoff and total-payoff through windows
- Average-energy games
- Non-Zero Sum Games for Reactive Synthesis
- Robust Multidimensional Mean-Payoff Games are Undecidable
- Bounding Average-Energy Games
- Graph Games and Reactive Synthesis
- Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time
- Infinite Runs in Weighted Timed Automata with Energy Constraints
- Half-Positional Determinacy of Infinite Games
- On the complexity of heterogeneous multidimensional quantitative games
- Computer Science Logic
- Mathematical Foundations of Computer Science 2004
- Generalized Parity Games
- CONCUR 2005 – Concurrency Theory
This page was built for publication: Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions
