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.
In: Proceedings of the 16th International Symposium on Automated Technology for Verifica- tion and Analysis (ATV A’18)
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
baseline 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
baseline 1polarities
baseline 1representative citing papers
Syntactic LTL obligations translate efficiently to minimal MTBDD-based deterministic weak automata, enabling on-the-fly synthesis with major runtime gains in Spot.
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.
-
Fast Obligation Translation and Synthesis
Syntactic LTL obligations translate efficiently to minimal MTBDD-based deterministic weak automata, enabling on-the-fly synthesis with major runtime gains in Spot.