We are pleased to announce that the following paper has been accepted for publication in the International Journal on Software Tools for Technology Transfer (STTT). Find the title and abstract below. Title and corresponding authors: Variations on Parallel Explicit Emptiness Checks for Generalized Büchi Automata Etienne Renault(1), Alexandre Duret-Lutz(1), Fabrice Kordon(2,3) and Denis Poitrenaud(3,4) (1) LRDE, EPITA, Kremlin-Bicêtre, France (2) Sorbonne Universités, UPMC Univ. Paris 06, France (3) CNRS UMR 7606, LIP6, F-75005 Paris, France (4) USPC, Université Paris Descartes, Paris, France Abstract: We present new parallel explicit emptiness checks for LTL model checking. Unlike existing parallel emptiness checks, these are based on a Strongly Connected Component (SCC) enumeration, support generalized Büchi acceptance, and require no synchronization points nor recomputing procedures. A salient feature of our algorithms is the use of a global union-find data structure in which multiple threads share structural information about the automaton checked. Besides these basic algorithms, we present one architectural variant isolating threads that write to the union-find, and one extension that decomposes the automaton based on the strength of its SCCs to use more optimized emptiness checks. The results from an extensive experimentation of our algorithms and their variations show encouraging performances, especially when the decomposition technique is used.