When Simulation Meets Antichains - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

When Simulation Meets Antichains


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
Fichier principal
Vignette du fichier
yu-fang-tacas10.pdf (1.1 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00460294 , version 1 (26-02-2010)


  • HAL Id : inria-00460294 , version 1


Parosh Aziz Abdulla, Yu-Fang Chen, Lukáš Holík, Richard Mayr, Tomáš Vojnar. When Simulation Meets Antichains. TACAS'10, the 16th International Conference on Tools And Algorithms for the Construction and Analysis of Systems, Mar 2010, Paphos, Cyprus. ⟨inria-00460294⟩


102 View
221 Download


Gmail Facebook X LinkedIn More