Detail publikace

Simulation Subsumption in Ramsey-based Büchi Automata Universality and Inclusion Testing

HOLÍK, L. VOJNAR, T. CHEN, Y. MAYR, R. HONG, C. ABDULLA, P. CLEMENTE, L.

Originální název

Simulation Subsumption in Ramsey-based Büchi Automata Universality and Inclusion Testing

Typ

zpráva odborná

Jazyk

angličtina

Originální abstrakt

There are two main classes of methods for checking universality and language inclusion of Büchi-automata: Rank-based methods and Ramsey-based methods. While rank-based methods have a better worst-case complexity, Ramsey-based methods have been shown to be quite competitive in practice. Previously, it was also shown (for universality checking) that a simple subsumption technique, which avoids exploration of certain cases, greatly improves the performance of the Ramsey-based method. Here, we present a much more general subsumption technique for the Ramsey-based method, which is based on using simulation preorder on the states of the Büchi-automata. This technique applies to both universality and inclusion checking, yielding a  substantial performance gain over the previously known simple subsumption approach.

Klíčová slova

Büchi automata, universality, language inclusion, Ramsey-based methods, simulation subsumption

Autoři

HOLÍK, L.; VOJNAR, T.; CHEN, Y.; MAYR, R.; HONG, C.; ABDULLA, P.; CLEMENTE, L.

Vydáno

26. 4. 2010

Nakladatel

Faculty of Information Technology BUT

Místo

FIT-TR-2010-02, Brno

Strany počet

30

URL

http://www.fit.vutbr.cz/~holik/pub/FIT-TR-2010-002.pdf

BibTex

@techreport{BUT192678,
  author="Lukáš {Holík} and Tomáš {Vojnar} and Yu-Fang {Chen} and Richard {Mayr} and Chih-Duo {Hong} and Parosh {Abdulla} and Lorenzo {Clemente}",
  title="Simulation Subsumption in Ramsey-based Büchi Automata Universality and Inclusion Testing",
  year="2010",
  publisher="Faculty of Information Technology BUT",
  address="FIT-TR-2010-02, Brno",
  pages="30",
  url="http://www.fit.vutbr.cz/~holik/pub/FIT-TR-2010-002.pdf"
}