Detail publikace

Optimizing an LTS-Simulation Algorithm

HOLÍK, L. ŠIMÁČEK, J.

Originální název

Optimizing an LTS-Simulation Algorithm

Typ

zpráva odborná

Jazyk

angličtina

Originální abstrakt

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.

Klíčová slova

simulation, labeled transition system, finite automata, tree automata

Autoři

HOLÍK, L.; ŠIMÁČEK, J.

Vydáno

17. 10. 2009

Místo

FIT-TR-2009-03, Brno

Strany počet

17

URL

http://www.fit.vutbr.cz/~holik/pub/FIT-TR-2009-03.pdf

BibTex

@techreport{BUT192697,
  author="Lukáš {Holík} and Jiří {Šimáček}",
  title="Optimizing an LTS-Simulation Algorithm",
  year="2009",
  address="FIT-TR-2009-03, Brno",
  pages="17",
  url="http://www.fit.vutbr.cz/~holik/pub/FIT-TR-2009-03.pdf"
}