| | |
Summary: RHEINISCH-
WESTF¨ALISCHE
TECHNISCHE
HOCHSCHULE
AACHEN
LEHRSTUHL F¨UR INFORMATIK 2
RWTH Aachen · D-52056 Aachen
http://www-i2.informatik.rwth-aachen.de/ 2
Prof. Dr. Ir. J.-P. Katoen
F. Gretz & F. Sher
Modeling and Verification of Probabilistic Systems
Summer term 2011
Series 3
Hand in on May 4th before the exercise class.
Exercise 1 (4 points)
Let M = (S, P, init, AP, L) be a finite Markov chain, s S and C, B S, n N, n 1. Let CU=n B
denote the event that a B-state will be entered after exactly n steps and all states that are visited before
belong to C. That is, s0 s1 s2 . . . |= CU=n B if and only if sn B and si C for 0 i < n. The event
CUnB denotes the union of the events CU=k B where k ranges over all natural numbers n.
Question: Provide an algorithm to compute
|
