Average-energy games
From MaRDI portal
Publication:5013874
Recommendations
Cites work
- A characterization of the minimum cycle mean in a digraph
- Automata, logics, and infinite games. A guide to current research
- Automatic Synthesis of Robust and Optimal Controllers – An Industrial Case Study
- Better Quality in Synthesis through Quantitative Objectives
- CONCUR 2005 – Concurrency Theory
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- Energy parity games
- Faster algorithms for mean-payoff games
- Games through Nested Fixpoints
- Half-Positional Determinacy of Infinite Games
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1134975 (Why is no real title available?)
- scientific article; zbMATH DE number 7361821 (Why is no real title available?)
- Infinite Runs in Weighted Timed Automata with Energy Constraints
- Looking at mean-payoff and total-payoff through windows
- Markov decision processes and stochastic games with total effective payoff
- Mathematical Foundations of Computer Science 2004
- Memoryless determinacy of parity and mean payoff games: a simple proof
- Model Checking Probabilistic Timed Automata with One or Two Clocks
- Optimal bounds for multiweighted and parametrised energy games
- Positional strategies for mean payoff games
- Quantitative timed simulation functions and refinement metrics for real-time systems
- Reachability in two-clock timed automata is PSPACE-complete
- Term Rewriting and Applications
- The bad match; a total reward stochastic game
- The complexity of mean payoff games on graphs
- The complexity of multi-mean-payoff and multi-energy games
Cited in
(7)
This page was built for publication: Average-energy games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5013874)
