| | |
Summary: RHEINISCH-
WESTFšALISCHE
TECHNISCHE
HOCHSCHULE
AACHEN
LEHRSTUHL FšUR INFORMATIK 2
RWTH Aachen · D-52056 Aachen · GERMANY
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 6
Hand in on May 25th before the exercise class.
Exercise 1 (1 points)
You have learned in the lecture that non-deterministic Bšuchi automata are more expressive than deter-
ministic Bšuchi automata. One might wonder why the "powerset construction", which is used to compute
a deterministic finite automaton from a non-deterministic one, fails for Bšuchi automata.
To understand this
a) construct a Bšuchi automaton for the language (a + b)a,
|
