Forum Numerica - Jorge Pérez: Asynchronous Session-Based Concurrency: Deadlock-freedom in Cyclic Process Networks


In this talk, I discuss recent work aimed at tackling the challenge of ensuring the deadlock-freedom property for message-passing processes that communicate asynchronously in cyclic process networks. I shall present two contributions. First, I will present Asynchronous Priority-based Classical Processes (APCP), a session-typed process framework that supports asynchronous communication, delegation, and recursion in cyclic process networks. Building upon the Curry-Howard correspondences between linear logic and session types, APCP enjoys essential properties, most notably deadlock-freedom. Second, I will present and illustrate a new concurrent λ-calculus with asynchronous session types, dubbed LAST^n. I will illustrate a precise technical connection between APCP and LAST^n, namely how to soundly transfer the deadlock-freedom guarantee from APCP to LAST^n.

About the speaker

Jorge A. Pérez is Associate Professor (tenured) at the University of Groningen, The Netherlands. Since 2019, he leads the Fundamental Computing Group, one of the research units of the Bernoulli Institute of Mathematics, Computer Science, and Artificial Intelligence ( The group currently consists of five research staff members and 6 PhD students. He is a selected member of the Young Academy Groningen. Prior to his current position, Pérez worked as Post-doctoral Researcher at NOVA University Lisbon (Portugal) and obtained his PhD at the University of Bologna (Italy). Jorge A. Pérez’s research interests concern Concurrency Theory, Semantics of Programming Languages, and Logic in Computer Science. He has graduated three PhD students, and currently supervises another three. During February 2019- January 2024, his research was supported by the Dutch Research Council (NWO) under a prestigious VIDI grant entitled “Unifying Correctness for Communicating Software”.