Undecidability of asynchronous session subtyping - Archive ouverte HAL Access content directly
Journal Articles Information and Computation Year : 2017

Undecidability of asynchronous session subtyping

(1) , (2) , (1)


Session types are used to describe communication protocols in distributed systems and, as usual in type theories, session subtyping characterizes substitutability of the communicating processes. We investigate the (un)decidability of subtyping for session types in asynchronously communicating systems. We first devise a core undecidable subtyping relation that is obtained by imposing limitations on the structure of types. Then, as a consequence of this initial undecidability result, we show that (differently from what stated or conjectured in the literature) the three notions of asynchronous subtyping defined so far for session types are all undecidable. Namely, we consider the asynchronous session subtyping by Mostrous and Yoshida for binary sessions, the relation by Chen et al. for binary sessions under the assumption that every message emitted is eventually consumed, and the one by Mostrous et al. for multiparty session types. Finally, by showing that two fragments of the core subtyping relation are decidable, we evince that further restrictions on the structure of types make our core subtyping relation decidable.

Dates and versions

hal-01637935 , version 1 (18-11-2017)



Mario Bravetti, Marco Carbone, Gianluigi Zavattaro. Undecidability of asynchronous session subtyping. Information and Computation, 2017, 256, pp.300 - 320. ⟨10.1016/j.ic.2017.07.010⟩. ⟨hal-01637935⟩
51 View
0 Download



Gmail Facebook Twitter LinkedIn More