About: Revisiting Resistance Speeds Up I/O Efficient LTL Model Checking     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
  • Revisiting resistance graph algorithms are those, whose correctness is not vulnerable to repeated edge exploration. Revisiting resistant I/O efficient graph algorithms exhibit considerable speed-up in practice in comparison to non-revisiting resistant algorithms. In the paper we present a new revisiting resistant I/O efficient LTL model checking algorithm. We analyze its theoretical I/O complexity and we experimentally compare its performance to already existing I/O efficient LTL model checking algorithms.
  • Revisiting resistance graph algorithms are those, whose correctness is not vulnerable to repeated edge exploration. Revisiting resistant I/O efficient graph algorithms exhibit considerable speed-up in practice in comparison to non-revisiting resistant algorithms. In the paper we present a new revisiting resistant I/O efficient LTL model checking algorithm. We analyze its theoretical I/O complexity and we experimentally compare its performance to already existing I/O efficient LTL model checking algorithms. (en)
Title
  • Revisiting Resistance Speeds Up I/O Efficient LTL Model Checking
  • Revisiting Resistance Speeds Up I/O Efficient LTL Model Checking (en)
skos:prefLabel
  • Revisiting Resistance Speeds Up I/O Efficient LTL Model Checking
  • Revisiting Resistance Speeds Up I/O Efficient LTL Model Checking (en)
skos:notation
  • RIV/00216224:14330/08:00024177!RIV10-GA0-14330___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(1ET400300504), P(1ET408050503), P(1M0545), P(GA201/06/1338), Z(MSM0021622419)
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
  • 392714
http://linked.open...ai/riv/idVysledku
  • RIV/00216224:14330/08:00024177
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • I/O efficient; accepting cycle detection; revisiting resistance (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [9682A18924FD]
http://linked.open...v/mistoKonaniAkce
  • Budapest, Hungary
http://linked.open...i/riv/mistoVydani
  • Berlin, Heidelberg
http://linked.open...i/riv/nazevZdroje
  • Tools and Algorithms for the Construction and Analysis of Systems
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
  • Barnat, Jiří
  • Brim, Luboš
  • Šimeček, Pavel
  • Weber, Michael
http://linked.open...vavai/riv/typAkce
http://linked.open...ain/vavai/riv/wos
  • 000254735100005
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
issn
  • 0302-9743
number of pages
http://purl.org/ne...btex#hasPublisher
  • Springer-Verlag
https://schema.org/isbn
  • 978-3-540-78799-0
http://localhost/t...ganizacniJednotka
  • 14330
is http://linked.open...avai/riv/vysledek of
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, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software