Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata

FIT, Brno University of Technology, Czech republic,email: {holik,vojnar}@fit.vutbr.czAbstract. We propose new antichain-based algorithms for checking universalityand inclusion of nondeterministic tree automata (NTA). We have implementedthese algorithms in a prototype tool and our experiments show that they providea significant improvement over the traditional determinisa tion-based approaches.We use our antichain-based inclusion checking algorithm tobuild an abstractregular tree model checking framework based entirely on NTA. We show the sig-nificantly improved efficiency of this framework through a se ries of experimentswith verifying various programs over dynamic linked tree-shaped data structures.