DeepAI AI Chat
Log In Sign Up

Complementing Büchi Automata with Ranker (Technical Report)

by   Vojtech Havlena, et al.

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.


page 1

page 2

page 3

page 4


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

This paper provides several optimizations of the rank-based approach for...

Modular Mix-and-Match Complementation of Büchi Automata (Technical Report)

Complementation of nondeterministic Büchi automata (BAs) is an important...

Succinct Determinisation of Counting Automata via Sphere Construction (Technical Report)

We propose an efficient algorithm for determinising counting automata (C...

Simulations in Rank-Based Büchi Automata Complementation

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

Alternating Good-for-MDP Automata

When omega-regular objectives were first proposed in model-free reinforc...

Visual Designing and Debugging of Deterministic Finite-State Machines in FSM

This article presents a visualization tool for designing and debugging d...