Name
Abstract | ||
|---|---|---|
We study a probabilistic variant of binary session types that relate to a class of Finite-State Markov Chains. The probability annotations in session types enable the reasoning on the probability that a session terminates successfully, for some user-definable notion of successful termination. We develop a type system for a simple session calculus featuring probabilistic choices and show that the success probability of well-typed processes agrees with that of the sessions they use. To this aim, the type system needs to track the propagation of probabilistic choices across different sessions. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.4230/LIPIcs.CONCUR.2020.14 | CONCUR |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Omar Inverso | 1 | 85 | 8.60 |
| Hernán Melgratti | 2 | 0 | 0.34 |
| Luca Padovani | 3 | 592 | 43.43 |
| Catia Trubiani | 4 | 314 | 31.36 |
| Emilio Tuosto | 5 | 499 | 42.62 |