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

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

Namespace Prefixes

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

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F03%3A00008587%21RIV08-MSM-14330___
rdf:type
n7:Vysledek skos:Concept
dcterms:description
Automated formal verification becomes a significant part of an industrial design process. Favourite formal verification method - model checking - is strongly limited by the size of the model of the verified system. It suffers from the so called state explosion problem. We propose to fight this problem by applying the idea of bounding the examined state space in explicit model checking. Moreover, we combine this approach with the distribution of the computation among the network of workstations. We consider several distributed bounded LTL model checking algorithms and carry out a series of experiments to evaluate them and to compare their behaviour. Automated formal verification becomes a significant part of an industrial design process. Favourite formal verification method - model checking - is strongly limited by the size of the model of the verified system. It suffers from the so called state explosion problem. We propose to fight this problem by applying the idea of bounding the examined state space in explicit model checking. Moreover, we combine this approach with the distribution of the computation among the network of workstations. We consider several distributed bounded LTL model checking algorithms and carry out a series of experiments to evaluate them and to compare their behaviour. Automated formal verification becomes a significant part of an industrial design process. Favourite formal verification method - model checking - is strongly limited by the size of the model of the verified system. It suffers from the so called state explosion problem. We propose to fight this problem by applying the idea of bounding the examined state space in explicit model checking. Moreover, we combine this approach with the distribution of the computation among the network of workstations. We consider several distributed bounded LTL model checking algorithms and carry out a series of experiments to evaluate them and to compare their behaviour.
dcterms:title
Distributed Explicit Bounded LTL Model Checking Distributed Explicit Bounded LTL Model Checking Distributed Explicit Bounded LTL Model Checking
skos:prefLabel
Distributed Explicit Bounded LTL Model Checking Distributed Explicit Bounded LTL Model Checking Distributed Explicit Bounded LTL Model Checking
skos:notation
RIV/00216224:14330/03:00008587!RIV08-MSM-14330___
n4:strany
30
n4:aktivita
n9:P n9:Z
n4:aktivity
P(GA201/03/0509), Z(MSM 143300001)
n4:dodaniDat
n14:2008
n4:domaciTvurceVysledku
n6:6986080
n4:druhVysledku
n12:D
n4:duvernostUdaju
n19:S
n4:entitaPredkladatele
n20:predkladatel
n4:idSjednocenehoVysledku
604122
n4:idVysledku
RIV/00216224:14330/03:00008587
n4:jazykVysledku
n10:eng
n4:klicovaSlova
Distributed Algorithms; LTL Model Checking; Bounded Model Checking
n4:klicoveSlovo
n5:Distributed%20Algorithms n5:Bounded%20Model%20Checking n5:LTL%20Model%20Checking
n4:kontrolniKodProRIV
[CB317572282F]
n4:mistoKonaniAkce
Boulder, Colorado, USA
n4:mistoVydani
Neuveden
n4:nazevZdroje
Second International Workshop on Parallel and Distributed Model Checking
n4:obor
n21:IN
n4:pocetDomacichTvurcuVysledku
1
n4:pocetTvurcuVysledku
1
n4:projekt
n11:GA201%2F03%2F0509
n4:rokUplatneniVysledku
n14:2003
n4:tvurceVysledku
Krčál, Pavel
n4:typAkce
n17:WRD
n4:zahajeniAkce
2003-01-01+01:00
n4:zamer
n16:MSM%20143300001
s:numberOfPages
18
n18:hasPublisher
Elsevier
n13:organizacniJednotka
14330