License: Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CONCUR.2020.14
URN: urn:nbn:de:0030-drops-128264
URL: https://drops.dagstuhl.de/opus/volltexte/2020/12826/
Go to the corresponding LIPIcs Volume Portal


Inverso, Omar ; Melgratti, HernĂ¡n ; Padovani, Luca ; Trubiani, Catia ; Tuosto, Emilio

Probabilistic Analysis of Binary Sessions

pdf-format:
LIPIcs-CONCUR-2020-14.pdf (0.6 MB)


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.

BibTeX - Entry

@InProceedings{inverso_et_al:LIPIcs:2020:12826,
  author =	{Omar Inverso and Hern{\'a}n Melgratti and Luca Padovani and Catia Trubiani and Emilio Tuosto},
  title =	{{Probabilistic Analysis of Binary Sessions}},
  booktitle =	{31st International Conference on Concurrency Theory (CONCUR 2020)},
  pages =	{14:1--14:21},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-160-3},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{171},
  editor =	{Igor Konnov and Laura Kov{\'a}cs},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2020/12826},
  URN =		{urn:nbn:de:0030-drops-128264},
  doi =		{10.4230/LIPIcs.CONCUR.2020.14},
  annote =	{Keywords: Probabilistic choices, session types, static analysis, deadlock freedom}
}

Keywords: Probabilistic choices, session types, static analysis, deadlock freedom
Collection: 31st International Conference on Concurrency Theory (CONCUR 2020)
Issue Date: 2020
Date of publication: 26.08.2020


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI