【24h】

Randomized Non-sequential Processes

机译:随机非顺序过程

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

摘要

A non-sequential, i.e. "true concurrency", semantics for randomized distributed algorithms is suggested. It is based on Petri nets and their branching processes. We introduce randomized Petri nets and their semantics, probabilistic branching processes. As a main result, we show that each probabilistic branching process defines a unique canonical probability space. Finally, we show that the non-sequential semantics differs from the classical sequential semantics, modelling a new adversary, called the distributed adversary.
机译:建议用于随机分布算法的非顺序语义,即“真正的并发”。它基于Petri网及其分支过程。我们介绍了随机的Petri网及其语义,概率分支过程。作为主要结果,我们证明了每个概率分支过程都定义了唯一的规范概率空间。最后,我们证明了非顺序语义不同于经典的顺序语义,它为新的对手建模,称为分布式对手。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号