Complementing Büchi Automata with Ranker
Vojtěch Havlena, Ondřej Lengál, Barbora Šmahlíková · Lecture notes in computer science · 2022
Abstract We present the toolRankerfor complementing Büchi automata (BAs).Rankerbuilds on our previous optimizations of rank-based BA complementation and pushes them even further using numerous heuristics to produce even smaller automata. Moreover, it contains novel optimizations of specialized constructions for complementing (i) inherently weak automata and (ii) semi-deterministic automata, all delivered in a robust tool. The optimizations significantly improve the usability ofRanker, as shown in an extensive experimental evaluation with real-world benchmarks, whereRankerproduced in the majority of cases a strictly smaller complement than other state-of-the-art tools.