Chronological Overview 
 Type-Hierarchical Overview 
Formal Methods in Computing
(Most of the papers antecedent to 1995
are not included in the list)
FRAMES  NO FRAME 

BarbaneradL17b (Unpublished)
Author(s) Franco Barbanera and Ugo de' Liguoro
Title« Retractability, games and orchestrators for session contracts »
URLhttp://arxiv.org/abs/1701.06142
Abstract
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.

BibTeX code

@unpublished{BarbaneradL17b,
  volume = {abs/1701.06142},
  author = {Franco Barbanera and Ugo de' Liguoro},
  timestamp = {Wed, 07 Jun 2017 14:42:08 +0200},
  url = {http://arxiv.org/abs/1701.06142},
  tag = {submitted for publication},
  title = {Retractability, games and orchestrators for session contracts},
  abstract = {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. },
  journal = {CoRR},
  year = {2017},
}


 Chronological Overview 
 Type-Hierarchical Overview 
Formal Methods in Computing
(Most of the papers antecedent to 1995
are not included in the list)
FRAMES  NO FRAME 

This document was generated by bib2html 3.3.
(Modified by Luca Paolini, under the GNU General Public License)

Valid HTML 4.01!