Skip to Main content Skip to Navigation
Conference papers

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 metadata

Cited literature [18 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Thursday, November 9, 2017 - 4:14:12 PM
Last modification on : Tuesday, January 18, 2022 - 2:26:05 PM
Long-term archiving on: : Saturday, February 10, 2018 - 1:39:43 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



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⟩



Les métriques sont temporairement indisponibles