DeepAI AI Chat
Log In Sign Up

Reducing (to) the Ranks: Efficient Rank-based Büchi Automata Complementation (Technical Report)

by   Vojtech Havlena, et al.

This paper provides several optimizations of the rank-based approach for complementing Büchi automata. We start with Schewe's theoretically optimal construction and develop a set of techniques for pruning its state space that are key to obtaining small complement automata in practice. In particular, the reductions (except one) have the property that they preserve (at least some) so-called super-tight runs, which are runs whose ranking is as tight as possible. Our evaluation on a large benchmark shows that the optimizations indeed significantly help the rank-based approach and that, in a large number of cases, the obtained complement is the smallest from those produced by a large number of state-of-the-art tools for Büchi complementation.


page 1

page 2

page 3

page 4


Complementing Büchi Automata with Ranker (Technical Report)

We present the tool Ranker for complementing Büchi automata (BAs). Ranke...

Simulations in Rank-Based Büchi Automata Complementation

The long search for an optimal complementation construction for Büchi au...

Planning in POMDPs Using Multiplicity Automata

Planning and learning in Partially Observable MDPs (POMDPs) are among th...

First-Order Rewritability of Frontier-Guarded Ontology-Mediated Queries

We focus on ontology-mediated queries (OMQs) based on (frontier-)guarded...

Automata Terms in a Lazy WSkS Decision Procedure (Technical Report)

We propose a lazy decision procedure for the logic WSkS. It builds a ter...

On randomized generation of slowly synchronizing automata

Motivated by the randomized generation of slowly synchronizing automata,...