@inproceedings{0fbddff0ed574ed9b410ccc5e00af34a,
title = "A modular approach for B{\"u}chi determinization",
abstract = "The problem of B{\"u}chi determinization is a fundamental problem with important applications in reactive synthesis, multi-agent systems and probabilistic verification. The first asymptotically optimal B{\"u}chi determinization (a.k.a. the Safra construction), was published in 1988. While asymptotically optimal, the Safra construction is notorious for its technical complexity and opaqueness in terms of intuition. While some improvements were published since the Safra construction, notably K{\"a}hler and Wilke's construction, understanding the constructions remains a non-trivial task. In this paper we present a modular approach to B{\"u}chi determinization, where the difficulties are addressed one at a time, rather than simultaneously, making the solutions natural and easy to understand. We build on the notion of the skeleton trees of K{\"a}hler and Wilke. We first show how to construct a deterministic automaton in the case the skeleton's width is one. Then we show how to construct a deterministic automaton in the case the skeleton's width is k (for any given k). The overall construction is obtained by running in parallel the automata for all widths.",
keywords = "B{\"u}chi automata, Determinization, Games, Synthesis, Verification",
author = "Dana Fisman and Yoad Lustig",
note = "Publisher Copyright: {\textcopyright} Dana Fisman and Yoad Lustig; licensed under Creative Commons License CC-BY.; 26th International Conference on Concurrency Theory, CONCUR 2015 ; Conference date: 01-09-2015 Through 04-09-2015",
year = "2015",
month = aug,
day = "1",
doi = "https://doi.org/10.4230/LIPIcs.CONCUR.2015.368",
language = "American English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
pages = "368--382",
editor = "Luca Aceto and {de Frutos Escrig}, David",
booktitle = "26th International Conference on Concurrency Theory, CONCUR 2015",
address = "Germany",
}