Hostname: page-component-7c8c6479df-p566r Total loading time: 0 Render date: 2024-03-18T00:05:08.026Z Has data issue: false hasContentIssue false

Fair subtyping for multi-party session types

Published online by Cambridge University Press:  10 November 2014

LUCA PADOVANI*
Affiliation:
Dipartimento di Informatica, Università degli Studi di Torino, Corso Svizzera 185, 10149 Torino, Italy Email: luca.padovani@unito.it

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.

Type
Paper
Copyright
Copyright © Cambridge University Press 2014 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Aceto, L. and Hennessy, M. (1992) Termination, deadlock, and divergence. Journal of the ACM 39 147187.CrossRefGoogle Scholar
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.Google Scholar
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.Google Scholar
Bravetti, M. and Zavattaro, G. (2008) A foundational theory of contracts for multi-party service composition. Fundamenta Informaticae 89 (4) 451478.Google Scholar
Bravetti, M. and Zavattaro, G. (2009) A theory of contracts for strong service compliance. Mathematical Structures in Computer Science 19 (3) 601638.CrossRefGoogle Scholar
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.CrossRefGoogle Scholar
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.CrossRefGoogle Scholar
Castagna, G., De Nicola, R. and Varacca, D. (2008) Semantic subtyping for the pi-calculus. Theoretical Computer Science 398 (1–3) 217242.CrossRefGoogle Scholar
Castagna, G., Dezani-Ciancaglini, M., Giachino, E. and Padovani, L. (2009) Foundations of session types. In: Proceedings of PPDP'09, ACM 219230.CrossRefGoogle Scholar
Castagna, G., Dezani-Ciancaglini, M. and Padovani, L. (2012) On global types and multi-party sessions. Logical Methods in Computer Science 8 145.Google Scholar
Courcelle, B. (1983) Fundamental properties of infinite trees. Theoretical Computer Science 25 95169.CrossRefGoogle Scholar
Gay, S. and Hole, M. (2005) Subtyping for session types in the π-calculus. Acta Informatica 42 (2–3) 191225.CrossRefGoogle Scholar
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.CrossRefGoogle Scholar
Honda, K., Yoshida, N. and Carbone, M. (2008) Multiparty asynchronous session types. In: Proceedings of POPL'08, ACM 273284.CrossRefGoogle Scholar
Honda, K. (1993) Types for dyadic interaction. In: Proceedings of CONCUR'93. Springer Lecture Notes in Computer Science 715 509523.CrossRefGoogle Scholar
Malik, R., Streader, D. and Reeves, S. (2004) Fair testing revisited: A process-algebraic characterisation of conflicts. In: Proceedings of ATVA'04, Springer 120134.Google Scholar
Malik, R., Streader, D. and Reeves, S. (2006) Conflicts and fair testing. International Journal of Foundations of Computer Science 17 (4) 797814.CrossRefGoogle Scholar
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.CrossRefGoogle Scholar
Natarajan, V. and Cleaveland, R. (1995) Divergence and fair testing. In: Proceedings of ICALP'95. Springer Lecture Notes in Computer Science 944 648659.CrossRefGoogle Scholar
Padovani, L. (2011a) Fair subtyping for multi-party session types. In: Proceedings of COORDINATION'11. Springer Lecture Notes in Computer Science 6721 127141.CrossRefGoogle Scholar
Padovani, L. (2011b) Session types = intersection types + union types. In: Proceedings of ITRS'10. Electronic Proceedings in Theoretical Computer Science 45 7189.CrossRefGoogle Scholar
Padovani, L. (2012) On projecting processes into session types. Mathematical Structures in Computer Science 22 237289.CrossRefGoogle Scholar
Padovani, L. (2013) Fair subtyping for open session types. In: Proceedings of ICALP'13, Part II. Springer Lecture Notes in Computer Science 7966 373384.CrossRefGoogle Scholar
Pierce, B. and Sangiorgi, D. (1996) Typing and subtyping for mobile processes. Mathematical Structures in Computer Science 6 (5) 409453.CrossRefGoogle Scholar
Rensink, A. and Vogler, W. (2007) Fair testing. Information and Computation 205 (2) 125198.CrossRefGoogle Scholar
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.CrossRefGoogle Scholar