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

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

Namespace Prefixes

PrefixIRI
n16http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n13http://localhost/temp/predkladatel/
n7http://purl.org/net/nknouf/ns/bibtex#
n19http://linked.opendata.cz/resource/domain/vavai/projekt/
n10http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n21http://linked.opendata.cz/ontology/domain/vavai/
n22https://schema.org/
shttp://schema.org/
n5http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14330%2F14%3A00073710%21RIV15-MSM-14330___/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n15http://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/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n20http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n8http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F14%3A00073710%21RIV15-MSM-14330___
rdf:type
n21:Vysledek skos:Concept
dcterms:description
In contrast to the usual understanding of probabilistic systems as stochastic processes, recently these systems have also been regarded as transformers of probabilities. In this paper, we give a natural definition of strong bisimulation for probabilistic systems corresponding to this view that treats probability distributions as first-class citizens. Our definition applies in the same way to discrete systems as well as to systems with uncountable state and action spaces. Several examples demonstrate that our definition re- fines the understanding of behavioural equivalences of probabilistic systems. In particular, it solves a longstanding open problem concerning the representation of memoryless continuous time by memoryfull continuous time. Finally, we give algorithms for computing this bisimulation not only for finite but also for classes of uncountably infinite systems. In contrast to the usual understanding of probabilistic systems as stochastic processes, recently these systems have also been regarded as transformers of probabilities. In this paper, we give a natural definition of strong bisimulation for probabilistic systems corresponding to this view that treats probability distributions as first-class citizens. Our definition applies in the same way to discrete systems as well as to systems with uncountable state and action spaces. Several examples demonstrate that our definition re- fines the understanding of behavioural equivalences of probabilistic systems. In particular, it solves a longstanding open problem concerning the representation of memoryless continuous time by memoryfull continuous time. Finally, we give algorithms for computing this bisimulation not only for finite but also for classes of uncountably infinite systems.
dcterms:title
Probabilistic Bisimulation: Naturally on Distributions Probabilistic Bisimulation: Naturally on Distributions
skos:prefLabel
Probabilistic Bisimulation: Naturally on Distributions Probabilistic Bisimulation: Naturally on Distributions
skos:notation
RIV/00216224:14330/14:00073710!RIV15-MSM-14330___
n3:aktivita
n14:S n14:P
n3:aktivity
P(GBP202/12/G061), S
n3:dodaniDat
n8:2015
n3:domaciTvurceVysledku
n10:3503054
n3:druhVysledku
n18:D
n3:duvernostUdaju
n11:S
n3:entitaPredkladatele
n5:predkladatel
n3:idSjednocenehoVysledku
39670
n3:idVysledku
RIV/00216224:14330/14:00073710
n3:jazykVysledku
n20:eng
n3:klicovaSlova
stochastic systems; probability; bisimulation; non-determinism; process algebra; coalgebra
n3:klicoveSlovo
n4:process%20algebra n4:coalgebra n4:bisimulation n4:non-determinism n4:stochastic%20systems n4:probability
n3:kontrolniKodProRIV
[AE76430FA99A]
n3:mistoKonaniAkce
Heidelberg Dordrecht London New York
n3:mistoVydani
Heidelberg Dordrecht London New York
n3:nazevZdroje
CONCUR 2014 - Concurrency Theory - 25th International Conference
n3:obor
n9:IN
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
3
n3:projekt
n19:GBP202%2F12%2FG061
n3:rokUplatneniVysledku
n8:2014
n3:tvurceVysledku
Krčál, Jan Hermanns, Holger Křetínský, Jan
n3:typAkce
n16:WRD
n3:zahajeniAkce
2014-01-01+01:00
s:issn
0302-9743
s:numberOfPages
17
n15:doi
10.1007/978-3-662-44584-6_18
n7:hasPublisher
Springer-Verlag
n22:isbn
9783662445839
n13:organizacniJednotka
14330