A Game Interpretation of Retractable Contracts
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.
KeywordsOperational Semantic Winning Strategy Session Type Affectible Action External Choice
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.
- 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.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.Barbanera, F., de’ Liguoro, U.: Sub-behaviour relations for session-based client/server systems. MSCS 25(6), 1339–1381 (2015)Google Scholar
- 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
- 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