会话契约的可撤回性、博弈与编排器
Retractability, games and orchestrators for session contracts
AI总结：
本文扩展会话契约以支持受第三方或双方协议影响的输出，定义“可影响合规性”，证明其等价于三方博弈、失败回滚及编排器中介的合规性，并建立获胜策略与编排器的一一对应，同时探讨子契约关系。
摘要：
会话契约是一种形式化方法，用于研究客户端/服务器交互协议并解释会话类型。我们扩展了会话契约，以表示那些在实际交互中是否发送取决于第三方或合作伙伴之间相互同意的输出。这样的契约因此是可适应的，或者如我们所说，是“可影响的”。在客户端/服务器系统中，通常，合规性表示服务器满足客户端的所有请求。我们定义了“可影响合规性”的抽象概念，并证明它具有精确的三方博弈论解释。这反过来又被证明等同于基于交互的合规性，这些交互可以经历一系列失败和回滚，也等同于基于交互的合规性，这些交互可以由编排器进行中介。此外，获胜策略与编排器之间存在一一对应的有效对应关系。还研究了可影响契约的子契约关系。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
