Simulations in Rank-Based Büchi Automata Complementation

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F19%3APU134960" target="_blank" >RIV/00216305:26230/19:PU134960 - isvavai.cz</a>

Result on the web

<a href="https://www.fit.vut.cz/research/publication/12051/" target="_blank" >https://www.fit.vut.cz/research/publication/12051/</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-030-34175-6_23" target="_blank" >10.1007/978-3-030-34175-6_23</a>

Result language

angličtina

Original language name

Simulations in Rank-Based Büchi Automata Complementation

Original language description

Complementation of Büchi automata is an essential technique used in some approaches for termination analysis of programs. The long search for an optimal complementation construction climaxed with the work of Schewe, who proposed a worst-case optimal rank-based procedure that generates complements of a size matching the theoretical lower bound of (0.76n)^n, modulo a polynomial factor of O(n^2). Although worst-case optimal, the procedure in many cases produces automata that are unnecessarily large. In this paper, we propose several ways of how to use the direct and delayed simulation relations to reduce the size of the automaton obtained in the rank-based complementation procedure. Our techniques are based on either (i) ignoring macrostates that cannot be used for accepting a word in the complement or (ii) saturating macrostates with simulation-smaller states, in order to decrease their total number. We experimentally showed that our techniques can indeed considerably decrease the size of the output of the 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

Result was created during the realization of more than one project. More information in the Projects tab.

Continuities

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

Publication year

2019

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

Proceedings of 17th Asian Symposium on Programming Languages and Systems (APLAS)

ISBN

—

ISSN

0302-9743

e-ISSN

—

Number of pages

21

Pages from-to

447-467

Publisher name

Springer International Publishing

Place of publication

Nusa Dua

Event location

Bali

Event date

Dec 1, 2019

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

000611530200023