Reachability games with relaxed energy constraints
From MaRDI portal
Publication:2672231
DOI10.1016/j.ic.2021.104806zbMath1487.68128arXiv1909.07653OpenAlexW4392136301MaRDI QIDQ2672231
Ritam Raha, Loïc Hélouët, Nicolas Markey
Publication date: 8 June 2022
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.07653
Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43) Applications of game theory (91A80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Positional strategies for mean payoff games
- Borel determinacy
- The complexity of mean payoff games on graphs
- Reachability in succinct one-counter games
- Energy parity games
- Strategy synthesis for multi-dimensional quantitative objectives
- The complexity of multi-mean-payoff and multi-energy games
- Optimal Bounds for Multiweighted and Parametrised Energy Games
- Generalized Mean-payoff and Energy Games
- On The Complexity of Counter Reachability Games*
- Timed automata with observers under energy constraints
- Bounding Average-Energy Games
- Energy Games in Multiweighted Automata
- Reachability in Succinct and Parametric One-Counter Automata
- Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time
- Infinite Runs in Weighted Timed Automata with Energy Constraints
- Energy and Mean-Payoff Games with Imperfect Information
- Model Checking Succinct and Parametric One-Counter Automata
- Automatic Synthesis of Robust and Optimal Controllers – An Industrial Case Study
- The Cost of Exactness in Quantitative Reachability
- Reachability in Two-Clock Timed Automata Is PSPACE-Complete
- Model Checking Probabilistic Timed Automata with One or Two Clocks
- Unnamed Item
- Unnamed Item
This page was built for publication: Reachability games with relaxed energy constraints
