Emptiness on weak alternating automata

Question

I wanted to ask if there are algorithms (also already implemented) for checking emptiness of an alternating automaton in particular a weak alternating automaton.

Answer 1

There's an implementation called ALASKA: http://www.antichains.be/alaska/ - you will also find links to the respective theory papers on that page.