HERMANNS, Holger, Jan KRČÁL and Jan KŘETÍNSKÝ. Probabilistic Bisimulation: Naturally on Distributions. In CONCUR 2014 - Concurrency Theory - 25th International Conference. Heidelberg Dordrecht London New York: Springer, 2014, p. 249-265. ISBN 978-3-662-44583-9. Available from: https://dx.doi.org/10.1007/978-3-662-44584-6_18.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Probabilistic Bisimulation: Naturally on Distributions
Authors HERMANNS, Holger (276 Germany), Jan KRČÁL (203 Czech Republic) and Jan KŘETÍNSKÝ (203 Czech Republic, guarantor, belonging to the institution).
Edition Heidelberg Dordrecht London New York, CONCUR 2014 - Concurrency Theory - 25th International Conference, p. 249-265, 17 pp. 2014.
Publisher Springer
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher Germany
Confidentiality degree is not subject to a state or trade secret
Publication form printed version "print"
Impact factor Impact factor: 0.402 in 2005
RIV identification code RIV/00216224:14330/14:00073710
Organization unit Faculty of Informatics
ISBN 978-3-662-44583-9
ISSN 0302-9743
Doi http://dx.doi.org/10.1007/978-3-662-44584-6_18
Keywords in English stochastic systems; probability; bisimulation; non-determinism; process algebra; coalgebra
Tags core_A, firank_A
Tags International impact, Reviewed
Changed by Changed by: RNDr. Pavel Šmerk, Ph.D., učo 3880. Changed: 27/4/2015 05:44.
Abstract
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.
Links
GBP202/12/G061, research and development projectName: Centrum excelence - Institut teoretické informatiky (CE-ITI) (Acronym: CE-ITI)
Investor: Czech Science Foundation
MUNI/A/0765/2013, interní kód MUName: Zapojení studentů Fakulty informatiky do mezinárodní vědecké komunity (Acronym: SKOMU)
Investor: Masaryk University, Category A
MUNI/A/0855/2013, interní kód MUName: Rozsáhlé výpočetní systémy: modely, aplikace a verifikace III. (Acronym: FI MAV III.)
Investor: Masaryk University, Category A
PrintDisplayed: 23/7/2024 06:33