About: Accepting Predecessors are Better than Back Edges in Distributed 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
  • Článek prezentuje nový distribuovaný algoritmus pro ověřování LTL vlastností založený na akceptujících předchůdcích. Je prezentováné několik optimalizací a experimentální výsledky (cs)
  • We present a new distributed-memory algorithm for enumerative LTL model-checking that is designed to be run on a cluster of workstations communicating via MPI. The detection of accepting cycles is based on computing maximal accepting predecessors and the subsequent decomposition of the graph into independent predecessor subgraphs induced by maximal accepting predecessors. Several optimizations of the basic algorithm are presented and the influence of the ordering on the algorithm performance is discussed. Experimental implementation of the algorithm shows promising results.
  • We present a new distributed-memory algorithm for enumerative LTL model-checking that is designed to be run on a cluster of workstations communicating via MPI. The detection of accepting cycles is based on computing maximal accepting predecessors and the subsequent decomposition of the graph into independent predecessor subgraphs induced by maximal accepting predecessors. Several optimizations of the basic algorithm are presented and the influence of the ordering on the algorithm performance is discussed. Experimental implementation of the algorithm shows promising results. (en)
Title
  • Accepting Predecessors are Better than Back Edges in Distributed LTL Model-Checking.
  • Accepting Predecessors are Better than Back Edges in Distributed LTL Model-Checking. (en)
  • Akceptující předchůdci v distrubuovaném LTL ověřování modelů (cs)
skos:prefLabel
  • Accepting Predecessors are Better than Back Edges in Distributed LTL Model-Checking.
  • Accepting Predecessors are Better than Back Edges in Distributed LTL Model-Checking. (en)
  • Akceptující předchůdci v distrubuovaném LTL ověřování modelů (cs)
skos:notation
  • RIV/00216224:14330/04:00010529!RIV09-GA0-14330___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GA201/03/0509), Z(MSM 143300001)
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
  • 553348
http://linked.open...ai/riv/idVysledku
  • RIV/00216224:14330/04:00010529
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • distributed - memory LTL model checking; graph predecessors (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [4DF18BA696C8]
http://linked.open...v/mistoKonaniAkce
  • Austin, USA
http://linked.open...i/riv/mistoVydani
  • Neuveden
http://linked.open...i/riv/nazevZdroje
  • Formal Methods in Computer-Aided Design (FMCAD)
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
  • Brim, Luboš
  • Moravec, Pavel
  • Černá, Ivana
  • Šimša, Jiří
http://linked.open...vavai/riv/typAkce
http://linked.open...ain/vavai/riv/wos
  • 000226785300025
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
number of pages
http://purl.org/ne...btex#hasPublisher
  • Springer-Verlag. LNCS
https://schema.org/isbn
  • 3-540-23738-0
http://localhost/t...ganizacniJednotka
  • 14330
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, 41 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software