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

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

Namespace Prefixes

PrefixIRI
n13http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n17http://purl.org/net/nknouf/ns/bibtex#
n10http://localhost/temp/predkladatel/
n14http://linked.opendata.cz/resource/domain/vavai/projekt/
n5http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n11http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14330%2F05%3A00012349%21RIV10-GA0-14330___/
n22http://linked.opendata.cz/ontology/domain/vavai/
n21http://linked.opendata.cz/resource/domain/vavai/zamer/
n18https://schema.org/
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#
n8http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n15http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n19http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n16http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F05%3A00012349%21RIV10-GA0-14330___
rdf:type
skos:Concept n22:Vysledek
dcterms:description
We consider qualitative and quantitative model-checking problems for probabilistic pushdown automata (pPDA) and various temporal logics. We prove that the qualitative and quantitative model-checking problem for omega-regular properties and pPDA is in 2-EXPSPACE and 3-EXPTIME, respectively. We also prove that model-checking the qualitative fragment of the logic PECTL* for pPDA is in 2-EXPSPACE, and model-checking the qualitative fragment of PCTL for pPDA is in EXPSPACE. Furthermore, model-checking the qualitative fragment of PCTL is shown to be EXPTIME-hard even for stateless pPDA. Finally, we show that PCTL model-checking is undecidable for pPDA, and PCTL+ model-checking is undecidable even for stateless pPDA. We consider qualitative and quantitative model-checking problems for probabilistic pushdown automata (pPDA) and various temporal logics. We prove that the qualitative and quantitative model-checking problem for omega-regular properties and pPDA is in 2-EXPSPACE and 3-EXPTIME, respectively. We also prove that model-checking the qualitative fragment of the logic PECTL* for pPDA is in 2-EXPSPACE, and model-checking the qualitative fragment of PCTL for pPDA is in EXPSPACE. Furthermore, model-checking the qualitative fragment of PCTL is shown to be EXPTIME-hard even for stateless pPDA. Finally, we show that PCTL model-checking is undecidable for pPDA, and PCTL+ model-checking is undecidable even for stateless pPDA.
dcterms:title
On the Decidability of Temporal Properties of Probabilistic Pushdown Automata On the Decidability of Temporal Properties of Probabilistic Pushdown Automata
skos:prefLabel
On the Decidability of Temporal Properties of Probabilistic Pushdown Automata On the Decidability of Temporal Properties of Probabilistic Pushdown Automata
skos:notation
RIV/00216224:14330/05:00012349!RIV10-GA0-14330___
n3:aktivita
n12:P n12:Z
n3:aktivity
P(1M0545), P(GA201/03/1161), Z(MSM0021622419)
n3:dodaniDat
n16:2010
n3:domaciTvurceVysledku
n5:9797092 n5:1762834 n5:9872655
n3:druhVysledku
n19:D
n3:duvernostUdaju
n4:S
n3:entitaPredkladatele
n11:predkladatel
n3:idSjednocenehoVysledku
534455
n3:idVysledku
RIV/00216224:14330/05:00012349
n3:jazykVysledku
n15:eng
n3:klicovaSlova
probabilistic pushdown automata; probabilistic temporal logics
n3:klicoveSlovo
n8:probabilistic%20pushdown%20automata n8:probabilistic%20temporal%20logics
n3:kontrolniKodProRIV
[D5327A53DA61]
n3:mistoKonaniAkce
February 24 - 26, 2005, Stuttgart, Germany
n3:mistoVydani
Berlin
n3:nazevZdroje
Proceedings of 22nd Symposium on Theoretical Aspects of Computer Science (STACS 2005)
n3:obor
n20:IN
n3:pocetDomacichTvurcuVysledku
3
n3:pocetTvurcuVysledku
3
n3:projekt
n14:GA201%2F03%2F1161 n14:1M0545
n3:rokUplatneniVysledku
n16:2005
n3:tvurceVysledku
Stražovský, Oldřich Kučera, Antonín Brázdil, Tomáš
n3:typAkce
n13:WRD
n3:zahajeniAkce
2005-01-01+01:00
n3:zamer
n21:MSM0021622419
s:numberOfPages
13
n17:hasPublisher
Springer-Verlag
n18:isbn
3-540-24998-2
n10:organizacniJednotka
14330