Skip to main content Accessibility help
×
×
Home

Fair subtyping for multi-party session types

  • LUCA PADOVANI (a1)
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 provide coinductive, axiomatic and algorithmic characterizations for it.

Copyright
References
Hide All
Aceto, L. and Hennessy, M. (1992) Termination, deadlock, and divergence. Journal of the ACM 39 147187.
Baldoni, M., Baroglio, C., Chopra, A. K., Desai, N., Patti, V. and Singh, M. P. (2009) Choice, interoperability, and conformance in interaction protocols and service choreographies. In: Proceedings of AAMAS'09, volume 2, ACM 843850.
Barbanera, F. and de'Liguoro, U. (2010) Two notions of sub-behaviour for session-based client/server systems. In: Proceedings of PPDP'10, ACM 155164.
Bravetti, M. and Zavattaro, G. (2008) A foundational theory of contracts for multi-party service composition. Fundamenta Informaticae 89 (4) 451478.
Bravetti, M. and Zavattaro, G. (2009) A theory of contracts for strong service compliance. Mathematical Structures in Computer Science 19 (3) 601638.
Bugliesi, M., Macedonio, D., Pino, L. and Rossi, S. (2010) Compliance preorders for web services. In: Proceedings of WS-FM'09. Springer Lecture Notes in Computer Science 6194 7691.
Caires, L. and Pfenning, F. (2010) Session types as intuitionistic linear propositions. In: Proceedings of CONCUR'10. Springer Lecture Notes in Computer Science 6269 222236.
Castagna, G., De Nicola, R. and Varacca, D. (2008) Semantic subtyping for the pi-calculus. Theoretical Computer Science 398 (1–3) 217242.
Castagna, G., Dezani-Ciancaglini, M., Giachino, E. and Padovani, L. (2009) Foundations of session types. In: Proceedings of PPDP'09, ACM 219230.
Castagna, G., Dezani-Ciancaglini, M. and Padovani, L. (2012) On global types and multi-party sessions. Logical Methods in Computer Science 8 145.
Courcelle, B. (1983) Fundamental properties of infinite trees. Theoretical Computer Science 25 95169.
Gay, S. and Hole, M. (2005) Subtyping for session types in the π-calculus. Acta Informatica 42 (2–3) 191225.
Honda, K., Vasconcelos, V. T. and Kubo, M. (1998) Language primitives and type disciplines for structured communication-based programming. In: Proceedings of ESOP'98. Springer Lecture Notes in Computer Science 1381 122138.
Honda, K., Yoshida, N. and Carbone, M. (2008) Multiparty asynchronous session types. In: Proceedings of POPL'08, ACM 273284.
Honda, K. (1993) Types for dyadic interaction. In: Proceedings of CONCUR'93. Springer Lecture Notes in Computer Science 715 509523.
Malik, R., Streader, D. and Reeves, S. (2004) Fair testing revisited: A process-algebraic characterisation of conflicts. In: Proceedings of ATVA'04, Springer 120134.
Malik, R., Streader, D. and Reeves, S. (2006) Conflicts and fair testing. International Journal of Foundations of Computer Science 17 (4) 797814.
Mooij, A. J., Stahl, C. and Voorhoeve, M. (2010) Relating fair testing and accordance for service replaceability. Journal of Logic and Algebraic Programming 79 (3–5) 233244.
Natarajan, V. and Cleaveland, R. (1995) Divergence and fair testing. In: Proceedings of ICALP'95. Springer Lecture Notes in Computer Science 944 648659.
Padovani, L. (2011a) Fair subtyping for multi-party session types. In: Proceedings of COORDINATION'11. Springer Lecture Notes in Computer Science 6721 127141.
Padovani, L. (2011b) Session types = intersection types + union types. In: Proceedings of ITRS'10. Electronic Proceedings in Theoretical Computer Science 45 7189.
Padovani, L. (2012) On projecting processes into session types. Mathematical Structures in Computer Science 22 237289.
Padovani, L. (2013) Fair subtyping for open session types. In: Proceedings of ICALP'13, Part II. Springer Lecture Notes in Computer Science 7966 373384.
Pierce, B. and Sangiorgi, D. (1996) Typing and subtyping for mobile processes. Mathematical Structures in Computer Science 6 (5) 409453.
Rensink, A. and Vogler, W. (2007) Fair testing. Information and Computation 205 (2) 125198.
Ware, S. and Malik, R. (2011) A state-based characterisation of the conflict preorder. In: Proceedings of FOCLASA'11. Electronic Proceedings in Theoretical Computer Science 58 3448.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Mathematical Structures in Computer Science
  • ISSN: 0960-1295
  • EISSN: 1469-8072
  • URL: /core/journals/mathematical-structures-in-computer-science
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed