Publication Details
Efficient Inclusion Checking on Explicit and Semi-Symbolic Tree Automata
Lengál Ondřej, Ing., Ph.D. (DITS FIT BUT)
Šimáček Jiří, Ing., Ph.D. (DITS FIT BUT)
Vojnar Tomáš, prof. Ing., Ph.D. (DITS FIT BUT)
tree automata, binary decision diagrams, language inclusion, downward inclusion checking, symbolic encoding
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.
@TECHREPORT{FITPUB9708,
author = "Luk\'{a}\v{s} Hol\'{i}k and Ond\v{r}ej Leng\'{a}l and Ji\v{r}\'{i} \v{S}im\'{a}\v{c}ek and Tom\'{a}\v{s} Vojnar",
title = "Efficient Inclusion Checking on Explicit and Semi-Symbolic Tree Automata",
pages = 22,
year = 2011,
location = "FIT-TR-2011-04, Brno, CZ",
publisher = "Faculty of Information Technology BUT",
language = "english",
url = "https://www.fit.vut.cz/research/publication/9708"
}