A modular approach for Büchi determinization

Dana Fisman, Yoad Lustig

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

9 Scopus citations

Abstract

The problem of Büchi determinization is a fundamental problem with important applications in reactive synthesis, multi-agent systems and probabilistic verification. The first asymptotically optimal Bü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ähler and Wilke's construction, understanding the constructions remains a non-trivial task. In this paper we present a modular approach to Bü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ä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.

Original languageEnglish
Title of host publication26th International Conference on Concurrency Theory, CONCUR 2015
EditorsLuca Aceto, David de Frutos Escrig
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Pages368-382
Number of pages15
ISBN (Electronic)9783939897910
DOIs
StatePublished - 1 Aug 2015
Externally publishedYes
Event26th International Conference on Concurrency Theory, CONCUR 2015 - Madrid, Spain
Duration: 1 Sep 20154 Sep 2015

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume42
ISSN (Print)1868-8969

Conference

Conference26th International Conference on Concurrency Theory, CONCUR 2015
Country/TerritorySpain
CityMadrid
Period1/09/154/09/15

Keywords

  • Büchi automata
  • Determinization
  • Games
  • Synthesis
  • Verification

Fingerprint

Dive into the research topics of 'A modular approach for Büchi determinization'. Together they form a unique fingerprint.

Cite this