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
n15http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n18http://purl.org/net/nknouf/ns/bibtex#
n8http://localhost/temp/predkladatel/
n13http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n12http://linked.opendata.cz/resource/domain/vavai/projekt/
n9http://linked.opendata.cz/ontology/domain/vavai/
n22http://linked.opendata.cz/resource/domain/vavai/zamer/
n7https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n14http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14330%2F05%3A00012348%21RIV10-GA0-14330___/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n10http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n19http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n16http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F05%3A00012348%21RIV10-GA0-14330___
rdf:type
n9:Vysledek skos:Concept
dcterms:description
We give a new characterization of those languages that are definable in fragments of LTL where the nesting depths of X and U modalities are bounded by given constants. This brings further results about various LTL fragments. We also propose a generic method for decomposing LTL formulae into an equivalent disjunction of %22semantically refined%22 LTL formulae, and indicate how this result can be used to improve the functionality of existing LTL model-checkers. We give a new characterization of those languages that are definable in fragments of LTL where the nesting depths of X and U modalities are bounded by given constants. This brings further results about various LTL fragments. We also propose a generic method for decomposing LTL formulae into an equivalent disjunction of %22semantically refined%22 LTL formulae, and indicate how this result can be used to improve the functionality of existing LTL model-checkers.
dcterms:title
Characteristic Patterns for LTL Characteristic Patterns for LTL
skos:prefLabel
Characteristic Patterns for LTL Characteristic Patterns for LTL
skos:notation
RIV/00216224:14330/05:00012348!RIV10-GA0-14330___
n3:aktivita
n6:Z n6:P
n3:aktivity
P(1M0545), P(GA201/03/1161), Z(MSM0021622419)
n3:dodaniDat
n16:2010
n3:domaciTvurceVysledku
n13:3978915 n13:9872655
n3:druhVysledku
n17:D
n3:duvernostUdaju
n5:S
n3:entitaPredkladatele
n14:predkladatel
n3:idSjednocenehoVysledku
514984
n3:idVysledku
RIV/00216224:14330/05:00012348
n3:jazykVysledku
n19:eng
n3:klicovaSlova
model-checking; linear temporal logic
n3:klicoveSlovo
n10:linear%20temporal%20logic n10:model-checking
n3:kontrolniKodProRIV
[5DC07C114C5D]
n3:mistoKonaniAkce
Liptovský Ján, Slovakia
n3:mistoVydani
Berlin, Heidelberg
n3:nazevZdroje
SOFSEM 2005: Theory and Practice of Computer Science
n3:obor
n20:IN
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
2
n3:projekt
n12:GA201%2F03%2F1161 n12:1M0545
n3:rokUplatneniVysledku
n16:2005
n3:tvurceVysledku
Strejček, Jan Kučera, Antonín
n3:typAkce
n15:WRD
n3:wos
000228554400027
n3:zahajeniAkce
2005-01-01+01:00
n3:zamer
n22:MSM0021622419
s:numberOfPages
11
n18:hasPublisher
Springer-Verlag
n7:isbn
3-540-24302-X
n8:organizacniJednotka
14330