Deadlock Freedom for Asynchronous and Cyclic Process Networks
Bas van den Heuvel (University of Groningen), Jorge A. P\'erez, (University of Groningen)

TL;DR
This paper introduces APCP, a behavioral type system framework that guarantees deadlock freedom in asynchronous, cyclic process networks with message passing, delegation, and recursion.
Contribution
It presents APCP, a novel typed process framework supporting asynchronous communication and cyclic process composition to ensure deadlock freedom.
Findings
APCP supports complex cyclic process networks.
The framework guarantees deadlock freedom in asynchronous settings.
It demonstrates expressiveness through various examples.
Abstract
This paper considers the challenging problem of establishing deadlock freedom for message-passing processes using behavioral type systems. In particular, we consider the case of processes that implement session types by communicating asynchronously in cyclic process networks. We present APCP, a typed process framework for deadlock freedom which supports asynchronous communication, delegation, recursion, and a general form of process composition that enables specifying cyclic process networks. We discuss the main decisions involved in the design of APCP and illustrate its expressiveness and flexibility using several examples.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
