Probability in Petri Nets
Probability in Petri Nets
复制标题
Petri 网中的概率
作者：
M. Kudlek
它表明，引入概率Petri网增加了他们的权力，特别是他们的可达集。为了实现这一目标，必须修改由概率有限自动机或具有复杂性限制的概率图灵机定义的可接受语言。
It is demonstrated that the introduction of probability into Petri nets increases their power, in particular for their reachability sets. To achieve this the definition of accepted languages by probabilistic finite automata or probabilistic Turing machines with complexity restriction has to be modified.