We describe a new and more efficient algorithm for checking universality and language inclusion on nondeterministic finite word automata (NFA) and tree automata (TA). To the best of our knowledge, the antichain-based approach proposed by De Wulf et al. was the most efficient one so far. Our idea is to exploit a simulation relation on the states of finite automata to accelerate the antichain-based algorithms. Normally, a simulation relation can be obtained fairly efficiently, and it can help the antichain-based approach to prune out a large portion of unnecessary search paths. We evaluate the performance of our new method on NFA/TA obtained from random regular expressions and from the intermediate steps of regular model checking. The results show that our approach significantly outperforms the previous antichain-based approach in most of the experiments. © 2010 Springer-Verlag.
CITATION STYLE
Abdulla, P. A., Chen, Y. F., Holík, L., Mayr, R., & Vojnar, T. (2010). When simulation meets antichains: (On checking language inclusion of nondeterministic finite (tree) automata). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6015 LNCS, pp. 158–174). https://doi.org/10.1007/978-3-642-12002-2_14
Mendeley helps you to discover research relevant for your work.