Journal article

HOLÍK Lukáš, LENGÁL Ondřej, ŠIMÁČEK Jiří and VOJNAR Tomáš. Efficient Inclusion Checking on Explicit and Semi-Symbolic Tree Automata. Lecture Notes in Computer Science. 2011, vol. 2011, no. 6996, pp. 243-258. ISSN 0302-9743.
Publication language:english
Original title:Efficient Inclusion Checking on Explicit and Semi-Symbolic Tree Automata
Title (cs):Efektivní testování inkluze explicitních a polo-symbolických stromových automatů
Journal:Lecture Notes in Computer Science, Vol. 2011, No. 6996, DE
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.
   author = {Lukáš Holík and Ondřej Lengál and Jiří Šimáček and Tomáš
   title = {Efficient Inclusion Checking on Explicit and Semi-Symbolic
	Tree Automata},
   pages = {243--258},
   journal = {Lecture Notes in Computer Science},
   volume = {2011},
   number = {6996},
   year = {2011},
   ISSN = {0302-9743},
   language = {english},
   url = {}

Your IPv4 address:
Switch to IPv6 connection

DNSSEC [dnssec]