马氏过程的合成构造
The compositional construction of Markov processes
摘要:
我们描述了一个代数组成的自动机,其中的行动有概率。我们说明了如何计算的概率达到死锁在k步骤中的经典的哲学家用餐问题的模型,并显示,使用Perron-Frobenius定理,这种概率趋于1 k趋于无穷大。
英文摘要:
We describe an algebra for composing automata in which the actions have probabilities. We illustrate by showing how to calculate the probability of reaching deadlock in k steps in a model of the classical Dining Philosopher problem, and show, using the Perron-Frobenius Theorem, that this probability tends to 1 as k tends to infinity.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。