paperbot · PL 论文追踪

全部论文 待读 收藏

P2 Retractability, games and orchestrators for session contracts

会话契约的可撤销性、博弈与编排器
LMCS vol.Volume 13, Issue 32017匹配度 2/10 · 该论文属于会话契约、形式语义与并发理论,研究三方博弈和编排器下的合规性,未涉及静态分析、LLM/Agent、浮点程序分析或贝叶斯程序分析,与用户当前核心研究方向基本无关。引用 3 inbox
Franco Barbanera, Ugo de'Liguoro
dblp: 2026-09-10crossref: 2026-09-10arxiv: 2026-09-10

AI 速览

一句话:扩展会话契约以支持可受第三方或双方协议影响的输出,并用三方博弈与编排器刻画其合规性。

论文研究会话契约(session contracts)这一用于描述客户端/服务器交互协议并解释会话类型的形式化工具。作者扩展契约,允许输出是否实际发送取决于第三方或伙伴间共识,称之为“可影响”(affectible)契约。为刻画此类系统中的合规性,作者定义抽象的“可影响合规”,并证明它有三方博弈论解释;该解释等价于基于失败与回滚序列的合规,也等价于通过编排器(orchestrator)中介的合规。进一步,获胜策略与编排器之间存在一一有效对应。最后还研究了可影响契约的子契约关系。

问题
如何扩展会话契约以表示实际发送依赖于第三方或双方约定的输出,并为其定义合适的合规性概念。
方法
引入 affectible 契约,定义 affectible compliance,并用三方博弈论解释、失败/回滚交互和编排器中介三种方式刻画该合规性。
评估
通过证明三种合规概念等价以及获胜策略与编排器间的一一有效对应来评估理论框架,并研究可影响契约的子契约关系。
原文摘要(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.

链接与引用

DOI 原文 · arXiv · PDF(开放获取) · DBLP

BibTeX
@article{Barbanerad17,
  title = {Retractability, games and orchestrators for session contracts},
  author = {Franco Barbanera and Ugo de'Liguoro},
  journal = {Logical Methods in Computer Science},
  volume = {Volume 13, Issue 3},
  year = {2017},
  doi = {10.23638/lmcs-13(3:15)2017}
}