License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICALP.2019.120
URN: urn:nbn:de:0030-drops-106963
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2019/10696/
Go to the corresponding LIPIcs Volume Portal

Löding, Christof ; Pirogov, Anton

Determinization of Büchi Automata: Unifying the Approaches of Safra and Muller-Schupp

pdf-format:
LIPIcs-ICALP-2019-120.pdf (0.6 MB)

Abstract

Determinization of Büchi automata is a long-known difficult problem, and after the seminal result of Safra, who developed the first asymptotically optimal construction from Büchi into Rabin automata, much work went into improving, simplifying, or avoiding Safra's construction. A different, less known determinization construction was proposed by Muller and Schupp. The two types of constructions share some similarities but their precise relationship was still unclear. In this paper, we shed some light on this relationship by proposing a construction from nondeterministic Büchi to deterministic parity automata that subsumes both constructions: Our construction leaves some freedom in the choice of the successor states of the deterministic automaton, and by instantiating these choices in different ways, one obtains as particular cases the construction of Safra and the construction of Muller and Schupp. The basis is a correspondence between structures that are encoded in the macrostates of the determinization procedures - Safra trees on one hand, and levels of the split-tree, which underlies the Muller and Schupp construction, on the other hand. Our construction also allows for mixing the mentioned constructions, and opens up new directions for the development of heuristics.

BibTeX - Entry

@InProceedings{lding_et_al:LIPIcs:2019:10696,
  author =	{Christof L{\"o}ding and Anton Pirogov},
  title =	{{Determinization of B{\"u}chi Automata: Unifying the Approaches of Safra and Muller-Schupp}},
  booktitle =	{46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
  pages =	{120:1--120:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-109-2},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{132},
  editor =	{Christel Baier and Ioannis Chatzigiannakis and Paola Flocchini and Stefano Leonardi},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2019/10696},
  URN =		{urn:nbn:de:0030-drops-106963},
  doi =		{10.4230/LIPIcs.ICALP.2019.120},
  annote =	{Keywords: B{\"u}chi automata, determinization, parity automata}
}

Keywords: Büchi automata, determinization, parity automata
Collection: 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)
Issue Date: 2019
Date of publication: 04.07.2019

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI