Probabilistic analysis of binary sessions
- Autores
- Inverso, Omar; Melgratti, Hernan Claudio; Padovani, Luca; Trubiani, Catia; Tuosto, Emilio
- Año de publicación
- 2020
- Idioma
- inglés
- Tipo de recurso
- artículo
- Estado
- versión publicada
- Descripción
- 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.
Fil: Inverso, Omar. Gran Sasso Science Institute ; Italia
Fil: Melgratti, Hernan Claudio. Universidad de Buenos Aires; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigación en Ciencias de la Computación; Argentina
Fil: Padovani, Luca. Università di Torino; Italia
Fil: Trubiani, Catia. Gran Sasso Science Institute ; Italia
Fil: Tuosto, Emilio. Gran Sasso Science Institute ; Italia - Materia
-
DEADLOCK FREEDOM
PROBABILISTIC CHOICES
SESSION TYPES
STATIC ANALYSIS - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- https://creativecommons.org/licenses/by/2.5/ar/
- Repositorio
- Institución
- Consejo Nacional de Investigaciones Científicas y Técnicas
- OAI Identificador
- oai:ri.conicet.gov.ar:11336/142154
Ver los metadatos del registro completo
id |
CONICETDig_a6144a3d649d9661d367e61b74d138b2 |
---|---|
oai_identifier_str |
oai:ri.conicet.gov.ar:11336/142154 |
network_acronym_str |
CONICETDig |
repository_id_str |
3498 |
network_name_str |
CONICET Digital (CONICET) |
spelling |
Probabilistic analysis of binary sessionsInverso, OmarMelgratti, Hernan ClaudioPadovani, LucaTrubiani, CatiaTuosto, EmilioDEADLOCK FREEDOMPROBABILISTIC CHOICESSESSION TYPESSTATIC ANALYSIShttps://purl.org/becyt/ford/1.2https://purl.org/becyt/ford/1We 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.Fil: Inverso, Omar. Gran Sasso Science Institute ; ItaliaFil: Melgratti, Hernan Claudio. Universidad de Buenos Aires; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigación en Ciencias de la Computación; ArgentinaFil: Padovani, Luca. Università di Torino; ItaliaFil: Trubiani, Catia. Gran Sasso Science Institute ; ItaliaFil: Tuosto, Emilio. Gran Sasso Science Institute ; ItaliaSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing2020-08info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/142154Inverso, Omar; Melgratti, Hernan Claudio; Padovani, Luca; Trubiani, Catia; Tuosto, Emilio; Probabilistic analysis of binary sessions; Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing; Leibniz International Proceedings in Informatics, LIPIcs; 171; 8-2020; 141-14211868-8969CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/doi/10.4230/LIPIcs.CONCUR.2020.14info:eu-repo/semantics/altIdentifier/url/https://drops.dagstuhl.de/opus/volltexte/2020/12826/info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-09-29T09:33:28Zoai:ri.conicet.gov.ar:11336/142154instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-09-29 09:33:28.959CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse |
dc.title.none.fl_str_mv |
Probabilistic analysis of binary sessions |
title |
Probabilistic analysis of binary sessions |
spellingShingle |
Probabilistic analysis of binary sessions Inverso, Omar DEADLOCK FREEDOM PROBABILISTIC CHOICES SESSION TYPES STATIC ANALYSIS |
title_short |
Probabilistic analysis of binary sessions |
title_full |
Probabilistic analysis of binary sessions |
title_fullStr |
Probabilistic analysis of binary sessions |
title_full_unstemmed |
Probabilistic analysis of binary sessions |
title_sort |
Probabilistic analysis of binary sessions |
dc.creator.none.fl_str_mv |
Inverso, Omar Melgratti, Hernan Claudio Padovani, Luca Trubiani, Catia Tuosto, Emilio |
author |
Inverso, Omar |
author_facet |
Inverso, Omar Melgratti, Hernan Claudio Padovani, Luca Trubiani, Catia Tuosto, Emilio |
author_role |
author |
author2 |
Melgratti, Hernan Claudio Padovani, Luca Trubiani, Catia Tuosto, Emilio |
author2_role |
author author author author |
dc.subject.none.fl_str_mv |
DEADLOCK FREEDOM PROBABILISTIC CHOICES SESSION TYPES STATIC ANALYSIS |
topic |
DEADLOCK FREEDOM PROBABILISTIC CHOICES SESSION TYPES STATIC ANALYSIS |
purl_subject.fl_str_mv |
https://purl.org/becyt/ford/1.2 https://purl.org/becyt/ford/1 |
dc.description.none.fl_txt_mv |
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. Fil: Inverso, Omar. Gran Sasso Science Institute ; Italia Fil: Melgratti, Hernan Claudio. Universidad de Buenos Aires; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigación en Ciencias de la Computación; Argentina Fil: Padovani, Luca. Università di Torino; Italia Fil: Trubiani, Catia. Gran Sasso Science Institute ; Italia Fil: Tuosto, Emilio. Gran Sasso Science Institute ; Italia |
description |
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. |
publishDate |
2020 |
dc.date.none.fl_str_mv |
2020-08 |
dc.type.none.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion http://purl.org/coar/resource_type/c_6501 info:ar-repo/semantics/articulo |
format |
article |
status_str |
publishedVersion |
dc.identifier.none.fl_str_mv |
http://hdl.handle.net/11336/142154 Inverso, Omar; Melgratti, Hernan Claudio; Padovani, Luca; Trubiani, Catia; Tuosto, Emilio; Probabilistic analysis of binary sessions; Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing; Leibniz International Proceedings in Informatics, LIPIcs; 171; 8-2020; 141-1421 1868-8969 CONICET Digital CONICET |
url |
http://hdl.handle.net/11336/142154 |
identifier_str_mv |
Inverso, Omar; Melgratti, Hernan Claudio; Padovani, Luca; Trubiani, Catia; Tuosto, Emilio; Probabilistic analysis of binary sessions; Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing; Leibniz International Proceedings in Informatics, LIPIcs; 171; 8-2020; 141-1421 1868-8969 CONICET Digital CONICET |
dc.language.none.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
info:eu-repo/semantics/altIdentifier/doi/10.4230/LIPIcs.CONCUR.2020.14 info:eu-repo/semantics/altIdentifier/url/https://drops.dagstuhl.de/opus/volltexte/2020/12826/ |
dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess https://creativecommons.org/licenses/by/2.5/ar/ |
eu_rights_str_mv |
openAccess |
rights_invalid_str_mv |
https://creativecommons.org/licenses/by/2.5/ar/ |
dc.format.none.fl_str_mv |
application/pdf application/pdf |
dc.publisher.none.fl_str_mv |
Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing |
publisher.none.fl_str_mv |
Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing |
dc.source.none.fl_str_mv |
reponame:CONICET Digital (CONICET) instname:Consejo Nacional de Investigaciones Científicas y Técnicas |
reponame_str |
CONICET Digital (CONICET) |
collection |
CONICET Digital (CONICET) |
instname_str |
Consejo Nacional de Investigaciones Científicas y Técnicas |
repository.name.fl_str_mv |
CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas |
repository.mail.fl_str_mv |
dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar |
_version_ |
1844613028640718848 |
score |
13.070432 |