Efficient Inclusion Checking On Explicit And Semi-Symbolic Tree Automata
ATVA'11: Proceedings of the 9th international conference on Automated technology for verification and analysis(2011)
摘要
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.
更多查看译文
关键词
Boolean Function, Sink Node, Binary Decision Diagram, Tree Automaton, Simulation Relation
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络