On Dynamical Probabilities, or: How to Learn to Shoot Straight

Abstract : In order to support, for example, a quantitative analysis of various algorithms, protocols etc. probabilistic features have been introduced into a number of programming languages and calculi. It is by now quite standard to define the formal semantics of (various) probabilistic languages, for example, in terms of Discrete Time Markov Chains (DTMCs). In most cases however the probabilities involved are represented by constants, i.e. one deals with static probabilities. In this paper we investigate a semantical framework which allows for changing, i.e. dynamic probabilities which is still based on time-homogenous DTMCs, i.e. the transition matrix representing the semantics of a program does not change over time.
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download

https://hal.inria.fr/hal-01631724
Contributor : Hal Ifip <>
Submitted on : Thursday, November 9, 2017 - 4:14:12 PM
Last modification on : Thursday, November 9, 2017 - 4:15:52 PM
Long-term archiving on : Saturday, February 10, 2018 - 1:39:43 PM

File

416253_1_En_16_Chapter.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Herbert Wiklicky. On Dynamical Probabilities, or: How to Learn to Shoot Straight. 18th International Conference on Coordination Languages and Models (COORDINATION), Jun 2016, Heraklion, Greece. pp.262-277, ⟨10.1007/978-3-319-39519-7_16⟩. ⟨hal-01631724⟩

Share

Metrics

Record views

265

Files downloads

69