Simulation relations for alternating Buchi automata
Quotienting by simulation equivalences is a well-established technique for reducing the size of nondeterministic Buchi automata. We adapt this technique to alternating Buchi automata. To this end we suggest two new quotients, namely minimax and semi-elective quotients, prove that they preserve the recognized languages, and show that computing them is not more difficult than computing quotients for nondeterministic Buchi automata. Our approach is game-theoretic; the proofs rely on a specifically tailored join operation for strategies in simulation games which is interesting in its own right. We explain the merits of our quotienting procedures with respect to converting alternating Buchi automata into nondeterministic ones. (c) 2005 Elsevier B.V. All rights reserved.
simulation relations buchi automata quotienting alternating automata buchi games automata simplification