@InProceedings{	  Padovani11c,
  author	= {Luca Padovani},
  title		= {{F}air {S}ubtyping for {M}ulti-{P}arty {S}ession {T}ypes},
  booktitle	= {Proceedings of the 13th Conference on Coordination Models
		  and Languages},
  volume	= {LNCS 6721},
  year		= {2011},
  pages		= {127-141},
  url		= {http://www.di.unito.it/~padovani/Papers/FairSessionTypes.pdf}
		  ,
  publisher	= {Springer},
  doi		= {10.1007/978-3-642-21464-6\_9},
  abstract	= {The standard subtyping relation used in dyadic session
		  type theories may compromise the liveness of multi-party
		  sessions. In this paper we define a \emph{fair} subtyping
		  relation for multi-party session types that preserves
		  liveness, we relate it with the standard subtyping
		  relation, and we give algorithms for deciding it. As a side
		  effect, we provide an original and remarkably simple
		  coinductive characterization of the fair testing preorder
		  for nondeterministic, sequential processes consisting of
		  internal choices of outputs and external choices of
		  inputs.}
}