The subtyping relation defined for dyadic session type theories may compromise the liveness of multi-party sessions. In this paper we define a fair subtyping relation for multi-party session types that preserves liveness, we relate it with the subtyping relation for dyadic session types, and we provide coinductive, axiomatic, and algorithmic characterizations for it.
Padovani, L. (2016). Fair Subtyping for Multi-Party Session Types. MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, 26(3), 424-464 [10.1017/S096012951400022X].
Fair Subtyping for Multi-Party Session Types
PADOVANI, Luca
2016
Abstract
The subtyping relation defined for dyadic session type theories may compromise the liveness of multi-party sessions. In this paper we define a fair subtyping relation for multi-party session types that preserves liveness, we relate it with the subtyping relation for dyadic session types, and we provide coinductive, axiomatic, and algorithmic characterizations for it.File in questo prodotto:
Eventuali allegati, non sono esposti
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
