Publication Details
Optimizing an LTS-Simulation Algorithm
simulation, labeled transition system, finite automata, tree automata
When comparing the fastest algorithm for computing the largest simulation preorder over
Kripke structures with the one for labeled transition systems (LTS), there is
a notable time and space complexity blow-up proportional to the size of the
alphabet of an LTS. In this paper, we present optimizations that lower this
blow-up and may turn a large alphabet of an LTS to an advantage. Our
experimental results show significant speed-ups and memory savings. Moreover,
the optimized algorithm allows one to improve asymptotic complexity of
procedures for computing simulations over tree automata using recently proposed
algorithms based on computing simulation over certain special LTS.
When comparing the fastest algorithm for computing the largest simulation preorder over
Kripke structures with the one for labeled transition systems (LTS), there is
a notable time and space complexity blow-up proportional to the size of the
alphabet of an LTS. In this paper, we present optimizations that lower this
blow-up and may turn a large alphabet of an LTS to an advantage. Our
experimental results show significant speed-ups and memory savings. Moreover,
the optimized algorithm allows one to improve asymptotic complexity of
procedures for computing simulations over tree automata using recently proposed
algorithms based on computing simulation over certain special LTS.
@INPROCEEDINGS{FITPUB9119,
author = "Luk\'{a}\v{s} Hol\'{i}k and Ji\v{r}\'{i} \v{S}im\'{a}\v{c}ek",
title = "Optimizing an LTS-Simulation Algorithm",
pages = "93--101",
booktitle = "5th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science",
year = 2009,
location = "Znojmo, CZ",
publisher = "Faculty of Informatics MU",
ISBN = "978-3-939897-15-6",
language = "english",
url = "https://www.fit.vut.cz/research/publication/9119"
}