Attributes | Values |
---|
rdf:type
| |
Description
| - When comparing the fastest algorithm for computing the largest simulation preorder over<br>Kripke structures with the one for labeled transition systems (LTS), there is<br>a notable time and space complexity blow-up proportional to the size of the<br>alphabet of an LTS. In this paper, we present optimizations that lower this<br>blow-up and may turn a large alphabet of an LTS to an advantage. Our<br>experimental results show significant speed-ups and memory savings. Moreover,<br>the optimized algorithm allows one to improve asymptotic complexity of<br>procedures for computing simulations over tree automata using recently proposed<br>algorithms based on computing simulation over certain special LTS. <br>
- When comparing the fastest algorithm for computing the largest simulation preorder over<br>Kripke structures with the one for labeled transition systems (LTS), there is<br>a notable time and space complexity blow-up proportional to the size of the<br>alphabet of an LTS. In this paper, we present optimizations that lower this<br>blow-up and may turn a large alphabet of an LTS to an advantage. Our<br>experimental results show significant speed-ups and memory savings. Moreover,<br>the optimized algorithm allows one to improve asymptotic complexity of<br>procedures for computing simulations over tree automata using recently proposed<br>algorithms based on computing simulation over certain special LTS. <br> (en)
|
Title
| - Optimizing an LTS-Simulation Algorithm
- Optimizing an LTS-Simulation Algorithm (en)
|
skos:prefLabel
| - Optimizing an LTS-Simulation Algorithm
- Optimizing an LTS-Simulation Algorithm (en)
|
skos:notation
| - RIV/00216305:26230/09:PU86231!RIV11-GA0-26230___
|
http://linked.open...avai/riv/aktivita
| |
http://linked.open...avai/riv/aktivity
| - P(GA102/07/0322), P(GD102/09/H042), P(GP201/09/P531), Z(MSM0021630528)
|
http://linked.open...vai/riv/dodaniDat
| |
http://linked.open...aciTvurceVysledku
| |
http://linked.open.../riv/druhVysledku
| |
http://linked.open...iv/duvernostUdaju
| |
http://linked.open...titaPredkladatele
| |
http://linked.open...dnocenehoVysledku
| |
http://linked.open...ai/riv/idVysledku
| - RIV/00216305:26230/09:PU86231
|
http://linked.open...riv/jazykVysledku
| |
http://linked.open.../riv/klicovaSlova
| - simulation, labeled transition system, finite automata, tree automata (en)
|
http://linked.open.../riv/klicoveSlovo
| |
http://linked.open...ontrolniKodProRIV
| |
http://linked.open...v/mistoKonaniAkce
| |
http://linked.open...i/riv/mistoVydani
| |
http://linked.open...i/riv/nazevZdroje
| - 5th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science
|
http://linked.open...in/vavai/riv/obor
| |
http://linked.open...ichTvurcuVysledku
| |
http://linked.open...cetTvurcuVysledku
| |
http://linked.open...vavai/riv/projekt
| |
http://linked.open...UplatneniVysledku
| |
http://linked.open...iv/tvurceVysledku
| - Holík, Lukáš
- Šimáček, Jiří
|
http://linked.open...vavai/riv/typAkce
| |
http://linked.open.../riv/zahajeniAkce
| |
http://linked.open...n/vavai/riv/zamer
| |
number of pages
| |
http://purl.org/ne...btex#hasPublisher
| - Masarykova univerzita. Fakulta informatiky
|
https://schema.org/isbn
| |
http://localhost/t...ganizacniJednotka
| |
is http://linked.open...avai/riv/vysledek
of | |