All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Sky Is Not the Limit: Tighter Rank Bounds for Elevator Automata in Buchi Automata Complementation

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F22%3APU142982" target="_blank" >RIV/00216305:26230/22:PU142982 - isvavai.cz</a>

  • Result on the web

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

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-030-99527-0_7" target="_blank" >10.1007/978-3-030-99527-0_7</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Sky Is Not the Limit: Tighter Rank Bounds for Elevator Automata in Buchi Automata Complementation

  • Original language description

    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 the ranks of states. First, we identify elevator automata, which is a large class of BAs (generalizing semi-deterministic BAs), occurring often in practice, where ranks of states are bounded according to the structure of strongly connected components. The bounds for elevator automata also carry over to general BAs that contain elevator automata as a sub-structure. Second, we introduce two techniques for refining bounds on the ranks of BA states using data-flow analysis of the automaton. We implement out techniques as an extension of the tool Ranker for BA complementation and show that they indeed greatly prune the generated state space, obtaining significantly better results and outperforming other state-of-the-art tools on a large set of benchmarks.

  • Czech name

  • Czech description

Classification

  • 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)

Result continuities

  • 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)

Others

  • Publication year

    2022

  • Confidentiality

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

Data specific for result type

  • Article name in the collection

    Proceedings of TACAS'22

  • ISBN

    978-3-030-99526-3

  • ISSN

    0302-9743

  • e-ISSN

  • Number of pages

    19

  • Pages from-to

    118-136

  • Publisher name

    Springer Verlag

  • Place of publication

    Munich

  • Event location

    Munich

  • Event date

    Apr 2, 2022

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000782398900007