scientific article; zbMATH DE number 7438564

zbMath1476.68024arXiv1509.07205MaRDI QIDQ5013874

Patricia Bouyer, Nicolas Markey, Mickael Randour, Simon Laursen, Kim Guldstrand Larsen

Publication date: 3 December 2021

Full work available at URL: https://arxiv.org/abs/1509.07205

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of game theory (91A80) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Reachability games with relaxed energy constraints ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
• Faster algorithms for mean-payoff games
• The bad match; a total reward stochastic game
• Positional strategies for mean payoff games
• A characterization of the minimum cycle mean in a digraph
• The complexity of mean payoff games on graphs
• Automata, logics, and infinite games. A guide to current research
• Memoryless determinacy of parity and mean payoff games: a simple proof
• 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
• Optimal Bounds for Multiweighted and Parametrised Energy Games
• Markov decision processes and stochastic games with total effective payoff
• Quantitative timed simulation functions and refinement metrics for real-time systems
• Model Checking Probabilistic Timed Automata with One or Two Clocks
• Infinite Runs in Weighted Timed Automata with Energy Constraints
• Energy Parity Games
• Half-Positional Determinacy of Infinite Games
• Automatic Synthesis of Robust and Optimal Controllers – An Industrial Case Study
• Better Quality in Synthesis through Quantitative Objectives
• Games through Nested Fixpoints
• Mathematical Foundations of Computer Science 2004
• Reachability in Two-Clock Timed Automata Is PSPACE-Complete
• Term Rewriting and Applications
• CONCUR 2005 – Concurrency Theory