The compositional construction of Markov processes

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.

Keywords

Logic in Computer Science, Category Theory, Probability

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/216321

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0901.2434
 http://arxiv.org/abs/0901.2434

Collections

arXiv