The compositional construction of Markov processes

Details The compositional construction of Markov processes The compositional construction of Markov processes

2009-01-16

arxiv.org/abs/0901.2434v1

Computer Science

Logic in Computer Science

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The compositional construction of Markov processes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The compositional construction of Markov processes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The compositional construction of Markov processes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-127249