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

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

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n7http://localhost/temp/predkladatel/
n14http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n13http://linked.opendata.cz/resource/domain/vavai/projekt/
n11http://linked.opendata.cz/ontology/domain/vavai/
n16http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14330%2F14%3A00073430%21RIV15-GA0-14330___/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n17http://bibframe.org/vocab/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n4http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n19http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n15http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n6http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F14%3A00073430%21RIV15-GA0-14330___
rdf:type
skos:Concept n11:Vysledek
dcterms:description
In this paper we study the model-checking problem for probabilistic pushdown automata (pPDA) and branching-time probabilistic logics PCTL and PCTL*. We show that model-checking pPDA against general PCTL formulae is undecidable, but we yield positive decidability results for the qualitative fragments of PCTL and PCTL*. For these fragments, we also give a complete complexity classification. In this paper we study the model-checking problem for probabilistic pushdown automata (pPDA) and branching-time probabilistic logics PCTL and PCTL*. We show that model-checking pPDA against general PCTL formulae is undecidable, but we yield positive decidability results for the qualitative fragments of PCTL and PCTL*. For these fragments, we also give a complete complexity classification.
dcterms:title
Branching-time model-checking of probabilistic pushdown automata Branching-time model-checking of probabilistic pushdown automata
skos:prefLabel
Branching-time model-checking of probabilistic pushdown automata Branching-time model-checking of probabilistic pushdown automata
skos:notation
RIV/00216224:14330/14:00073430!RIV15-GA0-14330___
n3:aktivita
n9:P
n3:aktivity
P(GAP202/10/1469)
n3:cisloPeriodika
1
n3:dodaniDat
n6:2015
n3:domaciTvurceVysledku
n14:5532787 n14:9872655 n14:1762834
n3:druhVysledku
n12:J
n3:duvernostUdaju
n19:S
n3:entitaPredkladatele
n16:predkladatel
n3:idSjednocenehoVysledku
5763
n3:idVysledku
RIV/00216224:14330/14:00073430
n3:jazykVysledku
n15:eng
n3:klicovaSlova
Markov chains; pushdown automata
n3:klicoveSlovo
n4:Markov%20chains n4:pushdown%20automata
n3:kodStatuVydavatele
NL - Nizozemsko
n3:kontrolniKodProRIV
[32151210EAD0]
n3:nazevZdroje
Journal of Computer and System Sciences
n3:obor
n18:IN
n3:pocetDomacichTvurcuVysledku
3
n3:pocetTvurcuVysledku
4
n3:projekt
n13:GAP202%2F10%2F1469
n3:rokUplatneniVysledku
n6:2014
n3:svazekPeriodika
80
n3:tvurceVysledku
Forejt, Vojtěch Brázdil, Tomáš Brožek, Václav Kučera, Antonín
n3:wos
000325386500011
s:issn
0022-0000
s:numberOfPages
18
n17:doi
10.1016/j.jcss.2013.07.001
n7:organizacniJednotka
14330