1 citations · 2 across the 4 of their papers we have counts for
4 papers
Complementation of Emerson-Lei Automata (Technical Report)
Vojtěch Havlena, Ondřej Lengál, Barbora Šmahlíková
We give new constructions for complementing subclasses of Emerson-Lei automata using modifications of rank-based Büchi automata complementation. In particular, we propose a special…
Modular Mix-and-Match Complementation of Büchi Automata (Technical Report)
Vojtěch Havlena, Ondřej Lengál, Yong Li +2
Complementation of nondeterministic Büchi automata (BAs) is an important problem in automata theory with numerous applications in formal verification, such as termination analysis…
Complementing Büchi Automata with Ranker (Technical Report)
Vojtěch Havlena, Ondřej Lengál, Barbora Šmahlíková
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 n…
Sky Is Not the Limit: Tighter Rank Bounds for Elevator Automata in Büchi Automata Complementation (Technical Report)
Vojtěch Havlena, Ondřej Lengál, Barbora Šmahlíková
We propose several heuristics for mitigating one of the main causes of combinatorial explosion in rank-based complementation of Büchi automata (BAs): unnecessarily high bounds on t…