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/
n6http://localhost/temp/predkladatel/
n15http://linked.opendata.cz/resource/domain/vavai/projekt/
n10http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n19http://linked.opendata.cz/ontology/domain/vavai/
n18http://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#
n4http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n13http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14330%2F08%3A00025864%21RIV10-MSM-14330___/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n16http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F08%3A00025864%21RIV10-MSM-14330___
rdf:type
skos:Concept n19:Vysledek
dcterms:description
We prove that probabilistic bisimilarity is decidable over probabilistic extensions of BPA and BPP processes. For normed subclasses of probabilistic BPA and BPP processes we obtain polynomial-time algorithms. Further, we show that probabilistic bisimilarity between probabilistic pushdown automata and finite-state systems is decidable in exponential time. If the number of control states in PDA is bounded by a fixed constant, then the algorithm needs only polynomial time. We prove that probabilistic bisimilarity is decidable over probabilistic extensions of BPA and BPP processes. For normed subclasses of probabilistic BPA and BPP processes we obtain polynomial-time algorithms. Further, we show that probabilistic bisimilarity between probabilistic pushdown automata and finite-state systems is decidable in exponential time. If the number of control states in PDA is bounded by a fixed constant, then the algorithm needs only polynomial time.
dcterms:title
Deciding probabilistic bisimilarity over infinite-state probabilistic systems Deciding probabilistic bisimilarity over infinite-state probabilistic systems
skos:prefLabel
Deciding probabilistic bisimilarity over infinite-state probabilistic systems Deciding probabilistic bisimilarity over infinite-state probabilistic systems
skos:notation
RIV/00216224:14330/08:00025864!RIV10-MSM-14330___
n3:aktivita
n7:Z n7:P
n3:aktivity
P(1M0545), Z(MSM0021622419)
n3:cisloPeriodika
2
n3:dodaniDat
n16:2010
n3:domaciTvurceVysledku
n10:9797092 n10:1762834 n10:9872655
n3:druhVysledku
n17:J
n3:duvernostUdaju
n5:S
n3:entitaPredkladatele
n13:predkladatel
n3:idSjednocenehoVysledku
362265
n3:idVysledku
RIV/00216224:14330/08:00025864
n3:jazykVysledku
n14:eng
n3:klicovaSlova
probabilistic bisimilarity; infinite-state systems
n3:klicoveSlovo
n4:infinite-state%20systems n4:probabilistic%20bisimilarity
n3:kodStatuVydavatele
DE - Spolková republika Německo
n3:kontrolniKodProRIV
[A6A10BD3F2AF]
n3:nazevZdroje
Acta informatica
n3:obor
n9:IN
n3:pocetDomacichTvurcuVysledku
3
n3:pocetTvurcuVysledku
3
n3:projekt
n15:1M0545
n3:rokUplatneniVysledku
n16:2008
n3:svazekPeriodika
45
n3:tvurceVysledku
Stražovský, Oldřich Kučera, Antonín Brázdil, Tomáš
n3:wos
000254400600003
n3:zamer
n18:MSM0021622419
s:issn
0001-5903
s:numberOfPages
24
n6:organizacniJednotka
14330