This HTML5 document contains 46 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n16http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n20http://purl.org/net/nknouf/ns/bibtex#
n19http://localhost/temp/predkladatel/
n7http://linked.opendata.cz/resource/domain/vavai/projekt/
n5http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n22http://linked.opendata.cz/ontology/domain/vavai/
n18https://schema.org/
n12http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n11http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14330%2F03%3A00008589%21RIV09-GA0-14330___/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n15http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n21http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n9http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F03%3A00008589%21RIV09-GA0-14330___
rdf:type
skos:Concept n22:Vysledek
dcterms:description
The fair cycle detection problem is at the heart of both LTL and fair CTL model checking. This paper presents a new distributed scalable algorithm for explicit fair cycle detection. Our method combines the simplicity of the distribution of explicitly presented data structure and the features of symbolic algorithm allowing for an efficient parallelisation. If a fair cycle (i.e. counterexample) is detected, then the algorithm produces a cycle, which is in general shorter than that produced by depth-first search based algorithms. Experimental results confirm that our approach outperforms that based on a direct implementation of the best sequential algorithm. The fair cycle detection problem is at the heart of both LTL and fair CTL model checking. This paper presents a new distributed scalable algorithm for explicit fair cycle detection. Our method combines the simplicity of the distribution of explicitly presented data structure and the features of symbolic algorithm allowing for an efficient parallelisation. If a fair cycle (i.e. counterexample) is detected, then the algorithm produces a cycle, which is in general shorter than that produced by depth-first search based algorithms. Experimental results confirm that our approach outperforms that based on a direct implementation of the best sequential algorithm. The fair cycle detection problem is at the heart of both LTL and fair CTL model checking. This paper presents a new distributed scalable algorithm for explicit fair cycle detection. Our method combines the simplicity of the distribution of explicitly presented data structure and the features of symbolic algorithm allowing for an efficient parallelisation. If a fair cycle (i.e. counterexample) is detected, then the algorithm produces a cycle, which is in general shorter than that produced by depth-first search based algorithms. Experimental results confirm that our approach outperforms that based on a direct implementation of the best sequential algorithm.
dcterms:title
Distributed Explicit Fair Cycle Detection Distributed Explicit Fair Cycle Detection Distributed Explicit Fair Cycle Detection
skos:prefLabel
Distributed Explicit Fair Cycle Detection Distributed Explicit Fair Cycle Detection Distributed Explicit Fair Cycle Detection
skos:notation
RIV/00216224:14330/03:00008589!RIV09-GA0-14330___
n3:aktivita
n15:P n15:Z
n3:aktivity
P(GA201/03/0509), Z(MSM 143300001)
n3:dodaniDat
n9:2009
n3:domaciTvurceVysledku
n5:4686128 n5:2361132
n3:druhVysledku
n10:D
n3:duvernostUdaju
n17:S
n3:entitaPredkladatele
n11:predkladatel
n3:idSjednocenehoVysledku
604123
n3:idVysledku
RIV/00216224:14330/03:00008589
n3:jazykVysledku
n6:eng
n3:klicovaSlova
distributed model checking; cycle detection
n3:klicoveSlovo
n4:distributed%20model%20checking n4:cycle%20detection
n3:kontrolniKodProRIV
[0CF232C85FFC]
n3:mistoKonaniAkce
Portland
n3:mistoVydani
Portland (Oregon, USA)
n3:nazevZdroje
SPIN Workshop 2003
n3:obor
n21:IN
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
2
n3:projekt
n7:GA201%2F03%2F0509
n3:rokUplatneniVysledku
n9:2003
n3:tvurceVysledku
Pelánek, Radek Černá, Ivana
n3:typAkce
n16:WRD
n3:wos
000183490400004
n3:zahajeniAkce
2003-01-01+01:00
n3:zamer
n12:MSM%20143300001
s:numberOfPages
25
n20:hasPublisher
Springer-Verlag
n18:isbn
3-540-40117-2
n19:organizacniJednotka
14330