The compositional construction of Markov processes

Simple item page
dc.creatorAlbasini, L. de Francesco
dc.creatorSabadini, N.
dc.creatorWalters, R. F. C.
dc.date2009-01-16
dc.date.accessioned2026-07-07T12:31:02Z
dc.date.available2026-07-07T12:31:02Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/0901.2434
dc.identifierhttp://arxiv.org/abs/0901.2434
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/216321
dc.subjectLogic in Computer Science
dc.subjectCategory Theory
dc.subjectProbability
dc.titleThe compositional construction of Markov processes
dc.typetext

Files

Collections

arXiv