【24h】

Commitment Machines

机译:承诺机

获取原文
获取原文并翻译 | 示例

摘要

We develop an approach in which we model communication protocols via commitment machines. Commitment machines supply a content to protocol states and actions in terms of the social commitments of the participants. The content can be reasoned about by the agents thereby enabling flexible execution of the given protocol. We provide reasoning rules to capture the evolution of commitments through the agents' actions. Because of its representation of content and its operational rules, a commitment machine effectively encodes a systematically enhanced version of the original protocol, which allows the original sequences of actions as well as other legal moves to accommodate exceptions and opportunities. We show how a commitment machine can be compiled into a finite state machine for efficient execution, and prove soundness and completeness of our compilation procedure.
机译:我们开发了一种通过承诺机器对通信协议进行建模的方法。承诺机器根据参与者的社会承诺向协议状态和动作提供内容。代理可以对内容进行推理,从而实现给定协议的灵活执行。我们提供推理规则,以捕获通过代理人行动做出的承诺的演变。由于内容的表示及其操作规则,承诺机可以有效地编码原始协议的系统增强版本,从而允许原始操作序列以及其他法律措施来适应例外和机会。我们展示了如何将承诺机器编译成有限状态机以有效执行,并证明我们的编译过程的健全性和完整性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号