About: Optimizing an LTS-Simulation Algorithm     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • 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. (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/10:PU96135!RIV12-MSM-26230___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GD102/09/H042), P(GP201/09/P531), Z(MSM0021630528)
http://linked.open...iv/cisloPeriodika
  • 7
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
  • 277426
http://linked.open...ai/riv/idVysledku
  • RIV/00216305:26230/10:PU96135
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...odStatuVydavatele
  • SK - Slovenská republika
http://linked.open...ontrolniKodProRIV
  • [D731015FC510]
http://linked.open...i/riv/nazevZdroje
  • Computing and Informatics
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...v/svazekPeriodika
  • 2010
http://linked.open...iv/tvurceVysledku
  • Holík, Lukáš
  • Šimáček, Jiří
http://linked.open...n/vavai/riv/zamer
issn
  • 1335-9150
number of pages
http://localhost/t...ganizacniJednotka
  • 26230
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 77 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software