Efficient Algorithms for Omega-Regular Energy Games

DOI10.1007/978-3-030-90870-6_9MaRDI QIDQ6488464zbMATH OpenFDO

Authors Gal Amram, Shahar Maoz, Or Pistiner, Jan Oliver Ringert

Publication date 21 April 2023

Full work available at URL https://doi.org/10.1007/978-3-030-90870-6_9

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Algorithmic game theory and complexity (91A68)

Recommendations

• A faster deterministic exponential time algorithm for energy games and mean payoff games
• Algorithms for Omega-Regular Games with Imperfect Information
• Algorithms for Omega-Regular Games with Imperfect Information
• Fixed-dimensional energy games are in pseudo-polynomial time
• Energy games in multiweighted automata
• Optimal bounds for multiweighted and parametrised energy games
• Quantitative solution of omega-regular games
• Energy and mean-payoff timed games

Cites work

• scientific article; zbMATH DE number 3960988 (Why is no real title available?)
• scientific article; zbMATH DE number 1500523 (Why is no real title available?)
• scientific article; zbMATH DE number 1538049 (Why is no real title available?)
• scientific article; zbMATH DE number 3799616 (Why is no real title available?)
• Algorithms for Omega-Regular Games with Imperfect Information
• An automaton learning approach to solving safety games over infinite graphs
• An improved algorithm for the evaluation of fixpoint expressions
• Automata, Languages and Programming
• Automata, Languages and Programming
• Automata, logics, and infinite games. A guide to current research
• Energy parity games
• Faster algorithms for mean-payoff games
• Graph-Based Algorithms for Boolean Function Manipulation
• Infinite Runs in Weighted Timed Automata with Energy Constraints
• Model checking games for the quantitative \(\mu \)-calculus
• On the use of MTBDDs for performability analysis and verification of stochastic systems.
• Performance heuristics for GR(1) synthesis and related algorithms
• Quantitative solution of omega-regular games
• STACS 2004
• Symbolic model checking for probabilistic processes
• Synthesis of Reactive(1) designs
• Verification, Model Checking, and Abstract Interpretation
• Verification, Model Checking, and Abstract Interpretation
• When not losing is better than winning: abstraction and refinement for the full \(\mu\)-calculus

Cited in

(3)

• Symbolic verification and strategy synthesis for turn-based stochastic games
• Battery transition systems
• Infinite-state energy games

This page was built for publication: Efficient Algorithms for Omega-Regular Energy Games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6488464)