Publication Details

Complementing Büchi Automata with Ranker

HAVLENA, V.; LENGÁL, O.; ŠMAHLÍKOVÁ, B. Complementing Büchi Automata with Ranker. In Proceedings of the 34th International Conference on Computer Aided Verification. Lecture Notes in Computer Science. Haifa: Springer Verlag, 2022. p. 188-201. ISBN: 978-3-031-13187-5. ISSN: 0302-9743.
Czech title
Komplementace Büchiho automatů pomocí Rankeru
Type
conference paper
Language
English
Authors
Keywords

Büchi automata, complementation, rank-based complementation, omega-regular
languages

Abstract

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.

Published
2022
Pages
188–201
Journal
Lecture Notes in Computer Science, no. 13372, ISSN 0302-9743
Proceedings
Proceedings of the 34th International Conference on Computer Aided Verification
Conference
34th International Conference on Computer Aided Verification, Haifa, IL
ISBN
978-3-031-13187-5
Publisher
Springer Verlag
Place
Haifa
DOI
UT WoS
000870310500010
EID Scopus
BibTeX
@inproceedings{BUT178204,
  author="Vojtěch {Havlena} and Ondřej {Lengál} and Barbora {Šmahlíková}",
  title="Complementing Büchi Automata with Ranker",
  booktitle="Proceedings of the 34th International Conference on Computer Aided Verification",
  year="2022",
  journal="Lecture Notes in Computer Science",
  number="13372",
  pages="188--201",
  publisher="Springer Verlag",
  address="Haifa",
  doi="10.1007/978-3-031-13188-2\{_}10",
  isbn="978-3-031-13187-5",
  issn="0302-9743"
}
Back to top