When Simulation Meets Antichains (On Checking Language Inclusion of Nondeterministic Finite (Tree) Automata)
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F10%3APU89513" target="_blank" >RIV/00216305:26230/10:PU89513 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
When Simulation Meets Antichains (On Checking Language Inclusion of Nondeterministic Finite (Tree) Automata)
Original language description
We describe a new and more efficient algorithm for checking universality<br>and language inclusion on nondeterministic finite word automata (NFA)<br>and tree automata (TA). To the best of our knowledge, the antichain-based approachIC0901<br>proposed by De Wulf et al. was the most efficient one so far. Our idea is<br>to exploit a simulation relation on the states of finite automata to accelerate the<br>antichain-based algorithms. Normally, a simulation relation can be obtained fairly<br>efficiently, andit can help the antichain-based approach to prune out a large portion<br>of unnecessary search paths.We evaluate the performance of our new method<br>on NFA/TA obtained from random regular expressions and from the intermediate<br>steps of regular model checking. The results show that our approach significantly<br>outperforms the previous antichain-based approach in most of the experiments.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach
Others
Publication year
2010
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Tools and Algorithms for the Construction and Analysis of Systems
ISBN
978-3-642-12001-5
ISSN
—
e-ISSN
—
Number of pages
17
Pages from-to
—
Publisher name
Springer Verlag
Place of publication
Berlín
Event location
Paphos
Event date
Mar 20, 2010
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—