Detail publikace

Optimizing an LTS-Simulation Algorithm

Originální název

Optimizing an LTS-Simulation Algorithm

Anglický název

Optimizing an LTS-Simulation Algorithm

Jazyk

en

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.

Anglický 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.

BibTex


@inproceedings{BUT30855,
  author="Lukáš {Holík} and Jiří {Šimáček}",
  title="Optimizing an LTS-Simulation Algorithm",
  annote="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.",
  address="Faculty of Informatics MU",
  booktitle="5th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science",
  chapter="30855",
  edition="NEUVEDEN",
  howpublished="print",
  institution="Faculty of Informatics MU",
  year="2009",
  month="november",
  pages="93--101",
  publisher="Faculty of Informatics MU",
  type="conference paper"
}