Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions
From MaRDI portal
Publication:5090979
DOI10.4230/LIPICS.FSTTCS.2018.38OpenAlexW2963055215MaRDI QIDQ5090979FDOQ5090979
Authors: Stéphane Le Roux, Arno Pauly, Mickael Randour 
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)
Cites Work
- Borel determinacy
- Automata, logics, and infinite games. A guide to current research
- Positional strategies for mean payoff games
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time
- Infinite Runs in Weighted Timed Automata with Energy Constraints
- Energy parity games
- Computer Science Logic
- Generalized Parity Games
- Mathematical Foundations of Computer Science 2004
- 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
- Robust Multidimensional Mean-Payoff Games are Undecidable
- Half-Positional Determinacy of Infinite Games
- CONCUR 2005 – Concurrency Theory
- Graph Games and Reactive Synthesis
- On the complexity of heterogeneous multidimensional quantitative games
- Extending finite-memory determinacy to multi-player games
- Average-energy games
- Bounding Average-Energy Games
- Non-Zero Sum Games for Reactive Synthesis
- Title not available (Why is that?)
Cited In (10)
- Title not available (Why is that?)
- Characterizing positionality in games of Infinite duration over infinite graphs
- Timed games with bounded window parity objectives
- Synthesis for Multi-weighted Games with Branching-Time Winning Conditions
- Half-positional objectives recognized by deterministic Büchi automata
- Title not available (Why is that?)
- Different strokes in randomised strategies: revisiting Kuhn's theorem under finite-memory assumptions
- Characterizing positionality in games of infinite duration over infinite graphs
- Title not available (Why is that?)
- Characterizing omega-regularity through finite-memory determinacy of games on infinite graphs
This page was built for publication: Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090979)
