Taming Confusion for Modeling and Implementing Probabilistic Concurrent Systems
Taming Confusion for Modeling and Implementing Probabilistic Concurrent Systems
复制标题
克服概率并发系统建模和实现的混乱
DOI：
10.1007/978-3-642-37036-6_23
复制
发表时间：
2013
期刊：
影响因子：
--
通讯作者：
D. Peled
中科院分区：
文献类型：
--
作者：
J. Katoen;D. Peled
在并发系统中，执行下一个转换的选择取决于独立或协作交互可用的代理之间的时间，以及与其他转换的冲突（非确定性选择）。这就产生了一个具有挑战性的建模和实现问题。当系统还需要做出概率选择时，情况变得更加复杂。我们使用Petri网模型来演示建模和实现问题。提出的解决方案涉及向Petri网结构中添加称为代理的顺序观察者。分布式概率选择的并发性和非确定性的存在下，通过选择代理，使选择，同时保证他们的观点是暂时稳定的。我们提供了一个分布式调度算法，实现一个系统，允许分布式概率选择。
In concurrent systems, the choice of executing the next transition depends both on the timing between the agents that make independent or collaborative interactions available, and on the conflicts (nondeterministic choices) with other transitions. This creates a challenging modeling and implementation problem. When the system needs to make also probabilistic choices, the situation becomes even more complicated. We use the model of Petri nets to demonstrate the modeling and implementation problem. The proposed solution involves adding sequential observers called agents to the Petri net structure. Distributed probabilistic choices are facilitated in the presence of concurrency and nondeterminism, by selecting agents that make the choices, while guaranteeing that their view is temporarily stable. We provide a distributed scheduling algorithm for implementing a system that allows distributed probabilistic choice.