Corpus ID: 222379193

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

@article{Havlena2020ReducingT,
  title={Reducing (to) the Ranks: Efficient Rank-based B{\"u}chi Automata Complementation (Technical Report)},
  author={Vojtvech Havlena and Ondvrej Leng'al},
  journal={ArXiv},
  year={2020},
  volume={abs/2010.07834}
}
  • Vojtvech Havlena, Ondvrej Leng'al
  • Published 2020
  • Mathematics, Computer Science
  • ArXiv
  • This paper provides several optimizations of the rank-based approach for complementing B\"{u}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… CONTINUE READING

    Figures and Tables from this paper.

    References

    SHOWING 1-10 OF 32 REFERENCES
    Simulations in Rank-Based Büchi Automata Complementation
    • 1
    • Highly Influential
    • PDF
    A Simple and Optimal Complementation Algorithm for Büchi Automata
    • 8
    • Highly Influential
    Improved Ramsey-Based Büchi Complementation
    • 16
    • PDF
    State of Büchi Complementation
    • 16
    • PDF
    Büchi complementation made tight
    • S. Schewe
    • Mathematics, Computer Science
    • STACS
    • 2009
    • 61
    • Highly Influential
    • PDF
    On the Power of Unambiguity in Büchi Complementation
    • 1
    • PDF
    Learning to Complement Büchi Automata
    • 8
    • Highly Influential
    • PDF
    When Simulation Meets Antichains
    • 84
    • PDF
    Lower Bounds for Complementation of ω-Automata Via the Full Automata Technique
    • 35
    Complementing Semi-deterministic Büchi Automata
    • 14
    • PDF