  In this work, we present multiple new optimizations and heuristics for the
determinization of B\"uchi automata that exploit a number of semantic and
structural properties, most of which may be applied together with any
determinization procedure. We built a prototype implementation where all the
presented heuristics can be freely combined and evaluated them, comparing our
implementation with the state-of-the-art tool spot on multiple data sets with
different characteristics. Our results show that the proposed optimizations and
heuristics can in some cases significantly decrease the size of the resulting
deterministic automaton.
