New Optimizations and Heuristics for Determinization of B\"uchi Automata

TL;DR

This paper introduces new optimizations and heuristics for converting B"uchi automata into deterministic automata, significantly reducing their size in some cases, by exploiting semantic and structural properties.

Contribution

It presents novel heuristics for B"uchi automata determinization that can be combined with existing procedures, improving efficiency and automaton size.

Findings

Optimizations can significantly reduce automaton size.

Heuristics are compatible with various determinization procedures.

Prototype implementation demonstrates improved performance.

Abstract

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.