A Game Interpretation of Retractable Contracts

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9686)

Abstract

In the setting of contract theory, retractable contracts have been defined to formalize binary session protocols where the partners can go back to certain particular synchronization points when the session gets stuck, looking for a successful state, if any.

In the present paper we propose a three-party game-theoretic interpretation of client/server systems of retractable contracts. In particular, we show that a client is retractable-compliant with a server if and only if there exists a winning strategy for a particular player in a game-theoretic model of contracts. Such a player can be looked at as a mediator, driving the choices in the retractable points. We show that winning strategies for the mediator player correspond to orchestrators in a system of orchestrated client/server sessions, and vice versa.

Keywords

Operational Semantic Winning Strategy Session Type Affectible Action External Choice 
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.

Notes

Acknowledgments

The authors wish to thank Massimo Bartoletti for an insightful discussion, Mariangiola Dezani for her everlasting support and the three anonymous referees for their help in improving the final version of the paper.

References

  1. 1.
    Abramsky, S., Mellies, P.A.: Concurrent games and full completeness. In: Proceedings of the 14th Symposium on Logic in Computer Science, pp. 431–442 (1999)Google Scholar
  2. 2.
    Barbanera, F., van Bakel, S., de’ Liguoro, U.: Orchestrated session compliance. In: Proceedings ICE 2015. EPTCS, vol. 189, pp. 21–36 (2015)Google Scholar
  3. 3.
    Barbanera, F., de’ Liguoro, U.: Sub-behaviour relations for session-based client/server systems. MSCS 25(6), 1339–1381 (2015)Google Scholar
  4. 4.
    Barbanera, F., Dezani-Ciancaglini, M., Lanese, I., de’ Liguoro, U.: Retractable contracts. In: PLACES. EPTCS, vol. 203, pp. 61–72. Open Publishing Ass. (2015)Google Scholar
  5. 5.
    Bartoletti, M., Cimoli, T., Pinna, G.M., Zunino, R.: Contracts as games on event structures. J. Logical Algebraic Methods Progr. 85(3), 399–424 (2016)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Bernardi, G., Hennessy, M.: Compliance and testing preorders differ. In: Counsell, S., Núñez, M. (eds.) SEFM 2013. LNCS, vol. 8368, pp. 69–81. Springer, Heidelberg (2014)CrossRefGoogle Scholar
  7. 7.
    Brandt, M., Henglein, F.: Coinductive axiomatization of recursive type equality and subtyping. Fundam. Inform. 33(4), 309–338 (1998)MathSciNetMATHGoogle Scholar
  8. 8.
    Bravetti, M., Zavattaro, G.: A theory of contracts for strong service compliance. Math. Struct. Comput. Sci. 19(3), 601–638 (2009)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Castagna, G., Gesbert, N., Padovani, L.: A theory of contracts for web services. ACM Trans. Prog. Lang. Sys. 31(5), 19:1–19:61 (2009)CrossRefMATHGoogle Scholar
  10. 10.
    Gay, S., Hole, M.: Subtyping for session types in the Pi-Calculus. Acta Informatica 42(2/3), 191–225 (2005)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Laneve, C., Padovani, L.: The Must preorder revisited. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol. 4703, pp. 212–225. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  12. 12.
    Nicola, R.D., Hennessy, M.: Testing equivalence for processes. In: Díaz, J. (ed.) ICALP 1983. LNCS, vol. 154, pp. 548–560. Springer, Heidelberg (1983)CrossRefGoogle Scholar
  13. 13.
    Padovani, L.: Contract-based discovery and adaptation of web services. In: Bernardo, M., Padovani, L., Zavattaro, G. (eds.) SFM 2009. LNCS, vol. 5569, pp. 213–260. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  14. 14.
    Padovani, L.: Contract-based discovery of web services modulo simple orchestrators. Theoret. Comput. Sci. 411, 3328–3347 (2010)MathSciNetCrossRefMATHGoogle Scholar
  15. 15.
    Winskel, G.: Event structures. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) Advances in Petri Nets 1986, Part II. LNCS, vol. 255, pp. 325–392. Springer, Heidelberg (1987)Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2016

Authors and Affiliations

  1. 1.Dipartimento di Matematica e InformaticaUniversity of CataniaCataniaItaly
  2. 2.Dipartimento di InformaticaUniversity of TorinoTorinoItaly

Personalised recommendations