Publication Details
Complementing Büchi Automata with Ranker
Lengál Ondřej, Ing., Ph.D. (DITS FIT BUT)
Šmahlíková Barbora, Bc. (FIT BUT)
Büchi automata, complementation, rank-based complementation, omega-regular languages
We present the tool Ranker for complementing Büchi automata (BAs). Ranker builds 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 of Ranker, as shown in an extensive experimental evaluation with real-world benchmarks, where Ranker produced in the majority of cases a strictly smaller complement than other state-of-the-art tools.
@INPROCEEDINGS{FITPUB12767,
author = "Vojt\v{e}ch Havlena and Ond\v{r}ej Leng\'{a}l and Barbora \v{S}mahl\'{i}kov\'{a}",
title = "Complementing B{\"{u}}chi Automata with Ranker",
pages = "188--201",
booktitle = "Proceedings of the 34th International Conference on Computer Aided Verification",
journal = "Lecture Notes in Computer Science",
number = 13372,
year = 2022,
location = "Haifa, IL",
publisher = "Springer Verlag",
ISBN = "978-3-031-13187-5",
ISSN = "0302-9743",
doi = "10.1007/978-3-031-13188-2\_10",
language = "english",
url = "https://www.fit.vut.cz/research/publication/12767"
}