Distributed
Computing
HS 2015
Prof. R. Wattenhofer / G. Bachmeier, S. Brandt, K.-T. Foerster, J. Seidel
Discrete Event Systems
Exercise Sheet 9
1
Competitive Analysis
In this exercise, we analyze algorithms for cellular networks such as GSM. In such netwo

Distributed
Computing
HS 2015
Prof. R. Wattenhofer / G. Bachmeier, S. Brandt, K.-T. Foerster, J. Seidel
Discrete Event Systems
Exercise Sheet 8
1
Bin Packing
In order to nance their living, Sebastian and Klaus work at the assembly line of a production
rm.

Distributed
Computing
HS 2015
Prof. R. Wattenhofer / G. Bachmeier, S. Brandt, K.-T. Foerster, J. Seidel
Discrete Event Systems
Exercise Sheet 7
1
Gloriabar
Every day, 540 students, professors and other personnel of ETH go to the Gloriabar for a delicious

Networked Systems Group (NSG)
HS 2015
Prof. L. Vanbever & A. El-Hassany,
based on Prof. R. Wattenhoers material
Discrete Event Systems
Exercise Sheet 1
1
Finite Automata
In this exercise you are asked to design your rst nite automata. Try to minimize the

Networked Systems Group (NSG)
HS 2015
Prof. L. Vanbever & A. El-Hassany,
based on Prof. R. Wattenhoers material
Discrete Event Systems
Exercise Sheet 2
1
Filter for an Input Stream [exam problem]
We would like to construct an automaton that recognizes sub

Computer Engineering and
Networks Laboratory
Computer Engineering Group (TEC)
HS 2015
Prof. L. Thiele / R. Jacob
Discrete Event Systems
Exercise Sheet 14
This last exercise session tries to put everything together somehow. You will discover a
modeling too

Computer Engineering and
Networks Laboratory
Computer Engineering Group (TEC)
HS 2015
Prof. L. Thiele / R. Jacob
Discrete Event Systems
Exercise Sheet 11
1
Sets Representation
During the design phase of a system, it is common to qualify some of the access

Computer Engineering and
Networks Laboratory
Computer Engineering Group (TEC)
HS 2015
Prof. L. Thiele / R. Jacob
Discrete Event Systems
Exercise Sheet 12
1
Comparison of Finite Automata
Here are two simple nite automata:
For each, we have a one bit encodi

Computer Engineering and
Networks Laboratory
Computer Engineering Group (TEC)
HS 2015
Prof. L. Thiele / R. Jacob
Discrete Event Systems
Exercise Sheet 13
1
Structural Properties of Petri Nets and Token Game
Given is the following Petri net N1 :
p3
t2
p2
t

Distributed
Computing
HS 2015
Prof. R. Wattenhofer / G. Bachmeier, S. Brandt, K.-T. Foerster, J. Seidel
Discrete Event Systems
Exercise Sheet 10
1
PhD-Scheduling [Exam]
In this assignment we wish to study the PhD-Scheduling-Problem, in which Professor Arn

Networked Systems Group (NSG)
HS 2015
Prof. L. Vanbever & A. El-Hassany,
based on Prof. R. Wattenhoers material
Discrete Event Systems
Exercise Sheet 4
1
Pumping Lemma Revisited
2
a) Determine whether the language L = cfw_1n | n N is regular. Prove your c

Networked Systems Group (NSG)
HS 2015
Prof. L. Vanbever & A. El-Hassany,
based on Prof. R. Wattenhoers material
Discrete Event Systems
Exercise Sheet 3
1
Pumping Lemma [Exam]
Is the following language regular? Prove your claims!
L = cfw_0a 1b 0c 1d | a, b

Networked Systems Group (NSG)
HS 2015
Prof. L. Vanbever & A. El-Hassany,
based on Prof. R. Wattenhoers material
Discrete Event Systems
Exercise Sheet 5
1
Designing Turing Machines
Alice is very happy because she was accepted for an internship at Tintel, o