The Compositional Construction of Markov Processes

12 years 11 months ago

Download dscpi.uninsubria.it

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 inﬁnity.

Luisa de Francesco Albasini, Nicoletta Sabadini, R

Real-time Traffic

ACS 2011 | Dining Philosopher Problem | Distributed And Parallel Computing | Perron-Frobenius Theorem | Probabilities |

claim paper

» Dynamic Workflow Composition using Markov Decision Processes

» Construction of Lyapunov functions for piecewisedeterministic Markov processes

» Speeding Up Planning in Markov Decision Processes via Automatically Constructed Abstractio...

» Compositional Performability Evaluation for STATEMATE

» Automated compositional Markov chain generation for a plainold telephone system

» Inducing Hidden Markov Models to Model LongTerm Dependencies

» Semantic Annotation and Composition of Business Processes with Maestro

» ClusteringBased Construction of Hidden Markov Models for Generative Kernels

Post Info
More Details (n/a)

Added	12 May 2011
Updated	12 May 2011
Type	Journal
Year	2011
Where	ACS
Authors	Luisa de Francesco Albasini, Nicoletta Sabadini, Robert F. C. Walters

Comments (0)

Sciweavers

The Compositional Construction of Markov Processes

ACS 2011 | Dining Philosopher Problem | Distributed And Parallel Computing | Perron-Frobenius Theorem | Probabilities |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers