Publication detail

Efficient Inclusion Checking on Explicit and Semi-Symbolic Tree Automata

HOLÍK, L. LENGÁL, O. ŠIMÁČEK, J. VOJNAR, T.

Original Title

Efficient Inclusion Checking on Explicit and Semi-Symbolic Tree Automata

Type

report

Language

English

Original Abstract

The paper considers several issues related to efficient use of tree automata in formal verification. First, a new efficient algorithm for inclusion checking on non-deterministic tree automata is proposed. The algorithm traverses the automaton downward, utilizing antichains and simulations to optimize its run. Results of a set of experiments are provided, showing that such an approach often very significantly outperforms the so far common upward inclusion checking. Next, a new semi-symbolic representation of non-deterministic tree automata, suitable for automata with huge alphabets, is proposed together with algorithms for upward as well as downward inclusion checking over this representation of tree automata. Results of a set of experiments comparing the performance of these algorithms are provided, again showing that the newly proposed downward inclusion is very often better than upward inclusion checking.

Keywords

tree automata, binary decision diagrams, language inclusion, downward inclusion checking, symbolic encoding

Authors

HOLÍK, L.; LENGÁL, O.; ŠIMÁČEK, J.; VOJNAR, T.

Released

9. 7. 2011

Publisher

Faculty of Information Technology BUT

Location

FIT-TR-2011-04, Brno

Pages count

22

URL

http://www.fit.vutbr.cz/~ilengal/pub/FIT-TR-2011-04.pdf

BibTex

@techreport{BUT192739,
  author="Lukáš {Holík} and Ondřej {Lengál} and Jiří {Šimáček} and Tomáš {Vojnar}",
  title="Efficient Inclusion Checking on Explicit and Semi-Symbolic Tree Automata",
  year="2011",
  publisher="Faculty of Information Technology BUT",
  address="FIT-TR-2011-04, Brno",
  pages="22",
  url="http://www.fit.vutbr.cz/~ilengal/pub/FIT-TR-2011-04.pdf"
}