Skip to main content
SpringerLink
Log in

Fair Subtyping for Multi-party Session Types

  • Conference paper
Coordination Models and Languages (COORDINATION 2011)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 6721))

Included in the following conference series:

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 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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. Bravetti, M., Zavattaro, G.: A foundational theory of contracts for multi-party service composition. Fundamenta Informaticae 89(4), 451–478 (2009)

    MATH  MathSciNet  Google Scholar 

  3. Bravetti, M., Zavattaro, G.: A theory of contracts for strong service compliance. Mathematical Structures in Computer Science 19, 601–638 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Chapter  Google Scholar 

  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)

    Chapter  Google Scholar 

  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. 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)

    Article  MATH  Google Scholar 

  8. Courcelle, B.: Fundamental properties of infinite trees. Theoretical Computer Science 25, 95–169 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  9. De Nicola, R., Hennessy, M.: Testing equivalences for processes. Theoretical Computer Science 34, 83–133 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  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. 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)

    Article  MATH  MathSciNet  Google Scholar 

  12. Gay, S., Hole, M.: Subtyping for session types in the π-calculus. Acta Informatica 42(2-3), 191–225 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  13. Hennessy, M.: Acceptance trees. Journal of the ACM 32(4), 896–928 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  14. Hennessy, M.: Algebraic Theory of Processes. Foundation of Computing. MIT Press, Cambridge (1988)

    MATH  Google Scholar 

  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. 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)

    Chapter  Google Scholar 

  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. 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)

    Chapter  Google Scholar 

  19. Padovani, L.: Session types at the mirror. EPTCS 12, 71–86 (2009)

    Article  Google Scholar 

  20. Padovani, L.: Fair subtyping for multi-party session types (2011), Full version available at http://www.di.unito.it/~padovani/Papers/FairSessionTypes.pdf

  21. Rensink, A., Vogler, W.: Fair testing. Information and Computation 205(2), 125–198 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università di Torino, Italy

    Luca Padovani

Authors
  1. Luca Padovani
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Sciences, Vrije Universiteit Brussel, Pleinlaan 2, 1050, Brussles, Belgium

    Wolfgang De Meuter

  2. Department of Computer Science and Engineering, Washington University, Campus Box 1045, One Brookings Drive, 63130-4899, St. Louis, MO, USA

    Gruia-Catalin Roman

Rights and permissions

Reprints and permissions

Copyright information

© 2011 IFIP International Federation for Information Processing

About this paper

Cite this paper

Padovani, L. (2011). Fair Subtyping for Multi-party Session Types. In: De Meuter, W., Roman, GC. (eds) Coordination Models and Languages. COORDINATION 2011. Lecture Notes in Computer Science, vol 6721. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21464-6_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21464-6_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21463-9

  • Online ISBN: 978-3-642-21464-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation