Publication detail

When Simulation Meets Antichains (On Checking Language Inclusion of Nondeterministic Finite (Tree) Automata)

HOLÍK, L. VOJNAR, T. ABDULLA, P. CHEN, Y. MAYR, R.

Original Title

When Simulation Meets Antichains (On Checking Language Inclusion of Nondeterministic Finite (Tree) Automata)

Type

report

Language

English

Original Abstract

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.

Keywords

finite automata, tree automata, language inclusion, universality, simulation, antichain

Authors

HOLÍK, L.; VOJNAR, T.; ABDULLA, P.; CHEN, Y.; MAYR, R.

Released

20. 1. 2010

Publisher

Faculty of Information Technology BUT

Location

FIT-TR-2010-01, Brno

Pages count

22

URL

http://www.fit.vutbr.cz/~holik/pub/FIT-TR-2010-001.pdf

BibTex

@techreport{BUT192702,
  author="Lukáš {Holík} and Tomáš {Vojnar} and Parosh {Abdulla} and Yu-Fang {Chen} and Richard {Mayr}",
  title="When Simulation Meets Antichains (On Checking Language Inclusion of Nondeterministic Finite (Tree) Automata)",
  year="2010",
  publisher="Faculty of Information Technology BUT",
  address="FIT-TR-2010-01, Brno",
  pages="22",
  url="http://www.fit.vutbr.cz/~holik/pub/FIT-TR-2010-001.pdf"
}