zbMATH — the first resource for mathematics

Efficient inclusion checking on explicit and semi-symbolic tree automata. (English) Zbl 1348.68105
Bultan, Tevfik (ed.) et al., Automated technology for verification and analysis. 9th international symposium, ATVA 2011, Taipei, Taiwan, October 11–14, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-24371-4/pbk). Lecture Notes in Computer Science 6996, 243-258 (2011).
Summary: 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.
For the entire collection see [Zbl 1223.68004].
Reviewer: Reviewer (Berlin)

68Q45 Formal languages and automata
68Q60 Specification and verification (program logics, model checking, etc.)
Full Text: DOI