2016
DOI: 10.1007/978-3-319-39519-7_16
|View full text |Cite
|
Sign up to set email alerts
|

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

Abstract: 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 se… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 17 publications
0
1
0
Order By: Relevance
“…In the probabilistic choices, instead of parameters p ∈ [0, 1] we could have used arbitrary functions p : S → [0, 1] mapping the current program state to a probability as discussed e.g. in [54]. This would not change our semantics fundamentally.…”
Section: The Programming Languagementioning
confidence: 99%
“…In the probabilistic choices, instead of parameters p ∈ [0, 1] we could have used arbitrary functions p : S → [0, 1] mapping the current program state to a probability as discussed e.g. in [54]. This would not change our semantics fundamentally.…”
Section: The Programming Languagementioning
confidence: 99%