Emptiness on weak alternating automata

I wanted to ask if there are algo开发者_如何学运维rithms (also already implemented) for checking emptiness of an alternating automaton in particular a weak alternating automaton.

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