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

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F21%3APU142924" target="_blank" >RIV/00216305:26230/21:PU142924 - isvavai.cz</a>

Result on the web

<a href="https://doi.org/10.4230/LIPIcs.CONCUR.2021.2" target="_blank" >https://doi.org/10.4230/LIPIcs.CONCUR.2021.2</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.4230/LIPIcs.CONCUR.2021.2" target="_blank" >10.4230/LIPIcs.CONCUR.2021.2</a>

Result language

angličtina

Original language name

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

Original language description

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 state-of-the-art tools for Büchi complementation.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

<a href="/en/project/GA20-07487S" target="_blank" >GA20-07487S: Scalable Techniques for Analysis of Complex Properties of Computer Systems</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2021

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

32nd International Conference on Concurrency Theory (CONCUR 2021)

ISBN

—

ISSN

1868-8969

e-ISSN

—

Number of pages

19

Pages from-to

1-19

Publisher name

Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik

Place of publication

Paris

Event location

Paris

Event date

Aug 23, 2021

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—