Deadlock Freedom for Asynchronous and Cyclic Process Networks

10/01/2021
by   Bas van den Heuvel, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/25/2021

Deadlock Freedom for Asynchronous and Cyclic Process Networks (Extended Version)

This paper considers the challenging problem of establishing deadlock fr...
research
08/09/2022

On Composing Communicating Systems

Communication is an essential element of modern software, yet programmin...
research
03/24/2022

Asynchronous Sessions with Input Races

We propose a calculus for asynchronous multiparty sessions where input c...
research
09/06/2022

Asynchronous Functional Sessions: Cyclic and Concurrent

We present Concurrent GV (CGV), a functional calculus with message-passi...
research
03/26/2021

Deadlock-Free Session Types in Linear Haskell

Priority Sesh is a library for session-typed communication in Linear Has...
research
03/18/2021

Zooid: a DSL for Certified Multiparty Computation

We design and implement Zooid, a domain specific language for certified ...
research
03/07/2018

Correct by Construction Resource-based Process Composition

The need for rigorous process composition is encountered in many situati...

Please sign up or login with your details

Forgot password? Click here to reset