HOA non-emptiness is NP-complete for standard acceptance conditions; inclusion is PSPACE-complete except EXPSPACE-complete for Emerson-Lei; HOG games are Pi2-complete for parity/safety and PSPACE-complete for Muller/Emerson-Lei.
Infinite games played on finite graphs.Ann
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
A novel circuit-based model for multi-agent systems yields complexity bounds on realizability and verification that address endemic issues in the explicit model and equilibrium analysis literature.
Obligation properties in LTLf+ admit a direct symbolic translation to deterministic weak automata, enabling linear-time synthesis via DWA games with effectiveness comparable to LTLf.
citing papers explorer
-
A Theory of Hanoi Omega-Automata and Games
HOA non-emptiness is NP-complete for standard acceptance conditions; inclusion is PSPACE-complete except EXPSPACE-complete for Emerson-Lei; HOG games are Pi2-complete for parity/safety and PSPACE-complete for Muller/Emerson-Lei.
-
Modeling Concurrent Multi-Agent Systems
A novel circuit-based model for multi-agent systems yields complexity bounds on realizability and verification that address endemic issues in the explicit model and equilibrium analysis literature.
-
Symbolic Synthesis for LTLf+ Obligations
Obligation properties in LTLf+ admit a direct symbolic translation to deterministic weak automata, enabling linear-time synthesis via DWA games with effectiveness comparable to LTLf.