Fair Subtyping for Multi-party Session Types

  • Luca Padovani
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6721)


The standard subtyping relation used in 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 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.


Normal Form Deduction System Message Type Liveness Property Alternative Characterization 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Barbanera, F., de’Liguoro, U.: Two notions of sub-behaviour for session-based client/server systems. In: Proceedings of PPDP 2010, pp. 155–164. ACM, New York (2010)Google Scholar
  2. 2.
    Bravetti, M., Zavattaro, G.: A foundational theory of contracts for multi-party service composition. Fundamenta Informaticae 89(4), 451–478 (2009)zbMATHMathSciNetGoogle Scholar
  3. 3.
    Bravetti, M., Zavattaro, G.: A theory of contracts for strong service compliance. Mathematical Structures in Computer Science 19, 601–638 (2009)CrossRefzbMATHMathSciNetGoogle Scholar
  4. 4.
    Bugliesi, M., Macedonio, D., Pino, L., Rossi, S.: Compliance Preorders for Web Services. In: Laneve, C., Su, J. (eds.) WS-FM 2009. LNCS, vol. 6194, pp. 76–91. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  5. 5.
    Carbone, M., Honda, K., Yoshida, N.: Structured communication-centred programming for web services. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol. 4421, pp. 2–17. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  6. 6.
    Castagna, G., Dezani-Ciancaglini, M., Giachino, E., Padovani, L.: Foundations of session types. In: Proceedings of PPDP 2009, pp. 219–230. ACM, New York (2009)Google Scholar
  7. 7.
    Castagna, G., Gesbert, N., Padovani, L.: A theory of contracts for Web services. ACM Transactions on Programming Languages and Systems 31(5), 1–61 (2009)CrossRefzbMATHGoogle Scholar
  8. 8.
    Courcelle, B.: Fundamental properties of infinite trees. Theoretical Computer Science 25, 95–169 (1983)CrossRefzbMATHMathSciNetGoogle Scholar
  9. 9.
    De Nicola, R., Hennessy, M.: Testing equivalences for processes. Theoretical Computer Science 34, 83–133 (1984)CrossRefzbMATHMathSciNetGoogle Scholar
  10. 10.
    De Nicola, R., Hennessy, M.: ccs without τ’s. In: Ehrig, H., Levi, G., Montanari, U. (eds.) CAAP 1987 and TAPSOFT 1987. LNCS, vol. 249, pp. 138–152. Springer, Heidelberg (1987)Google Scholar
  11. 11.
    Frisch, A., Castagna, G., Benzaken, V.: Semantic subtyping: dealing set-theoretically with function, union, intersection, and negation types. Journal of the ACM 55(4), 1–64 (2008)CrossRefzbMATHMathSciNetGoogle Scholar
  12. 12.
    Gay, S., Hole, M.: Subtyping for session types in the π-calculus. Acta Informatica 42(2-3), 191–225 (2005)CrossRefzbMATHMathSciNetGoogle Scholar
  13. 13.
    Hennessy, M.: Acceptance trees. Journal of the ACM 32(4), 896–928 (1985)CrossRefzbMATHMathSciNetGoogle Scholar
  14. 14.
    Hennessy, M.: Algebraic Theory of Processes. Foundation of Computing. MIT Press, Cambridge (1988)zbMATHGoogle Scholar
  15. 15.
    Honda, K.: Types for dyadic interaction. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715, pp. 509–523. Springer, Heidelberg (1993)Google Scholar
  16. 16.
    Honda, K., Vasconcelos, V.T., Kubo, M.: Language primitives and type discipline for structured communication-based programming. In: Hankin, C. (ed.) ESOP 1998. LNCS, vol. 1381, pp. 122–138. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  17. 17.
    Honda, K., Yoshida, N., Carbone, M.: Multiparty asynchronous session types. In: Proceedings of POPL 2008, pp. 273–284. ACM, New York (2008)Google Scholar
  18. 18.
    Natarajan, V., Cleaveland, R.: Divergence and fair testing. In: Fülöp, Z. (ed.) ICALP 1995. LNCS, vol. 944, pp. 648–659. Springer, Heidelberg (1995)CrossRefGoogle Scholar
  19. 19.
    Padovani, L.: Session types at the mirror. EPTCS 12, 71–86 (2009)CrossRefGoogle Scholar
  20. 20.
    Padovani, L.: Fair subtyping for multi-party session types (2011), Full version available at
  21. 21.
    Rensink, A., Vogler, W.: Fair testing. Information and Computation 205(2), 125–198 (2007)CrossRefzbMATHMathSciNetGoogle Scholar
  22. 22.
    Vasconcelos, V.T.: Fundamentals of session types. In: Bernardo, M., Padovani, L., Zavattaro, G. (eds.) SFM 2009. LNCS, vol. 5569, pp. 158–186. Springer, Heidelberg (2009)CrossRefGoogle Scholar

Copyright information

© IFIP International Federation for Information Processing 2011

Authors and Affiliations

  • Luca Padovani
    • 1
  1. 1.Dipartimento di InformaticaUniversità di TorinoItaly

Personalised recommendations