Deciding Subtyping for Asynchronous Multiparty Sessions

TL;DR

This paper introduces a precise subtyping relation for asynchronous multiparty session types using communicating state machines, enabling safe implementation substitution and verification with polynomial-time decidability.

Contribution

It defines a novel subtyping relation for asynchronous MSTs with CSMs, addressing implementation safety and correctness verification.

Findings

Subtyping relation is decidable in polynomial time.

Provides conditions for safe implementation substitution.

Ensures deadlock freedom and protocol fidelity.

Abstract

Multiparty session types (MSTs) are a type-based approach to verifying communication protocols, represented as global types in the framework. We present a precise subtyping relation for asynchronous MSTs with communicating state machines (CSMs) as implementation model. We address two problems: when can a local implementation safely substitute another, and when does an arbitrary CSM implement a global type? We define safety with respect to a given global type, in terms of subprotocol fidelity and deadlock freedom. Our implementation model subsumes existing work which considers local types with restricted choice. We exploit the connection between MST subtyping and refinement to formulate concise conditions that are directly checkable on the candidate implementations, and use them to show that both problems are decidable in polynomial time.