A Gentle Overview of Asynchronous Session-based Concurrency: Deadlock Freedom by Typing

While formal models of concurrency tend to focus on synchronous communication, asynchronous communication is relevant in practice.In this paper, we will discuss asynchronous communication in the context of session-based concurrency, the model of computation in which session types specify the structure of the two-party protocols implemented by the channels of a communicating process.We overview recent work on addressing the challenge of ensuring the deadlock-freedom property for message-passing processes that communicate asynchronously in cyclic process networks governed by session types.We offer a gradual presentation of three typed process frameworks and outline how they may be used to guarantee deadlock freedom for a concurrent functional language with sessions.

Authors

Institutions

Publication Details

Journal
Electronic Proceedings in Theoretical Computer Science
Published
2024-12-10
DOI
https://doi.org/10.4204/eptcs.414.1
Primary Topic
Parallel Computing and Optimization Techniques
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Gentle Overview of Asynchronous Session-based Concurrency: Deadlock Freedom by Typing

Jorge A. Pérez, Bas van den Heuvel
Electronic Proceedings in Theoretical Computer Science
Parallel Computing and Optimization Techniques
article

A Gentle Overview of Asynchronous Session-based Concurrency: Deadlock Freedom by Typing

Jorge A. Pérez, Bas van den Heuvel
article en

Abstract

While formal models of concurrency tend to focus on synchronous communication, asynchronous communication is relevant in practice.In this paper, we will discuss asynchronous communication in the context of session-based concurrency, the model of computation in which session types specify the structure of the two-party protocols implemented by the channels of a communicating process.We overview recent work on addressing the challenge of ensuring the deadlock-freedom property for message-passing processes that communicate asynchronously in cyclic process networks governed by session types.We offer a gradual presentation of three typed process frameworks and outline how they may be used to guarantee deadlock freedom for a concurrent functional language with sessions.

Electronic Proceedings in Theoretical Computer ScienceVol. 414
University of Freiburg (DE), University of Groningen (NL), Karlsruhe University of Applied Sciences (DE)
Nederlandse Organisatie voor Wetenschappelijk Onderzoek
Openalex Percentile: Top 76%
Parallel Computing and Optimization Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

A Gentle Overview of Asynchronous Session-based Concurrency: Deadlock Freedom by Typing — Jorge A. Pérez, Bas van den Heuvel · Electronic Proceedings in Theoretical Computer Science (2024) | TGRS Research Map | TGRS