Franco Barbanera ; Ugo de'Liguoro - Retractability, games and orchestrators for session contracts

lmcs:2664 - Logical Methods in Computer Science, August 25, 2017, Volume 13, Issue 3 - https://doi.org/10.23638/LMCS-13(3:15)2017
Retractability, games and orchestrators for session contracts

Authors: Franco Barbanera ; Ugo de'Liguoro

    Session contracts is a formalism enabling to investigate client/server interaction protocols and to interpret session types. We extend session contracts in order to represent outputs whose actual sending in an interaction depends on a third party or on a mutual agreement between the partners. Such contracts are hence adaptable, or as we say "affectible". In client/server systems, in general, compliance stands for the satisfaction of all client's requests by the server. We define an abstract notion of "affectible compliance" and show it to have a precise three-party game-theoretic interpretation. This in turn is shown to be equivalent to a compliance based on interactions that can undergo a sequence of failures and rollbacks, as well as to a compliance based on interactions which can be mediated by an orchestrator. Besides, there is a one-to-one effective correspondence between winning strategies and orchestrators. The relation of subcontract for affectible contracts is also investigated.


    Volume: Volume 13, Issue 3
    Published on: August 25, 2017
    Accepted on: August 25, 2017
    Submitted on: August 25, 2017
    Keywords: Computer Science - Logic in Computer Science

    Share

    Consultation statistics

    This page has been seen 495 times.
    This article's PDF has been downloaded 359 times.