About this Course

2,167 recent views
Shareable Certificate
Earn a Certificate upon completion
100% online
Start instantly and learn at your own schedule.
Flexible deadlines
Reset deadlines in accordance to your schedule.
Approx. 17 hours to complete
English
Shareable Certificate
Earn a Certificate upon completion
100% online
Start instantly and learn at your own schedule.
Flexible deadlines
Reset deadlines in accordance to your schedule.
Approx. 17 hours to complete
English

Offered by

Placeholder

EIT Digital

Syllabus - What you will learn from this course

Week
1

Week 1

15 minutes to complete

Introduction

15 minutes to complete
1 video (Total 5 min), 1 reading
1 video
1 reading
Some suggested reading material10m
5 hours to complete

Modeling systems as token consumption/production systems

5 hours to complete
11 videos (Total 70 min), 3 readings, 6 quizzes
11 videos
Consumption and production of tokens5m
Modeling an intensive care unit5m
Modeling a wireless LAN radio4m
Modeling and refining an industrial robot6m
Pick your own system1m
Classes of Petri-nets8m
Causality, choice and concurrency (modeling patterns)9m
Refinement of consumption/production systems8m
Interpreting pictures for performance analysis10m
Draw your own model3m
3 readings
Always ask yourself...10m
The refinement of the robot.10m
Tooling10m
5 practice exercises
Basic modeling ideas30m
Modeling Warehouse 1330m
Modeling features30m
Definition of refinement30m
Which is a refinement of which?30m
Week
2

Week 2

5 hours to complete

Syntax and semantics

5 hours to complete
14 videos (Total 103 min), 5 readings, 5 quizzes
14 videos
Syntax and semantics3m
The basics9m
Extensions4m
Prefix orders7m
Exercise on prefix orders7m
Proof that flows form a prefix order14m
Formalizing interpretations as functions8m
Counting is order preserving6m
Formalizing the Petri-net interpretation10m
Proof that the number of tokens in a single-rate dataflow cycle is constant13m
Formalizing timing6m
Formalizing eager scheduling5m
Formalizing periodic scheduling4m
5 readings
Flags and Fitch style proofs10m
Slides of the proof10m
Slides of the proof10m
Exercise: Formalize best-case response times10m
About the next quiz.10m
5 practice exercises
Bipartite graphs30m
Thinking about observation functions30m
Isomorphism30m
Summarize!30m
Formalizing performance properties30m
Week
3

Week 3

5 hours to complete

Performance analysis

5 hours to complete
20 videos (Total 131 min), 2 readings, 5 quizzes
20 videos
Throughput is bounded by 1/MCM8m
Proof - a1m
Proof - b9m
Proof - c1m
Proof - d3m
Proof - e7m
Proof - f4m
Proof - g4m
Proof - h8m
Proof - i12m
Proof - j8m
The throughput bound is tight5m
Periodic scheduling of a dataflow graph12m
Latency analysis of a periodic schedule6m
Latency analysis of an eager schedule9m
The formal definition of latency5m
The boot-up time of a dataflow graph4m
Optimizing latency estimates w.r.t. boot-up time5m
Buffering and backpressure5m
2 readings
Slides of the proof10m
Alternative proof in synchronization and linearity10m
5 practice exercises
Summarize!30m
Calculating the MCM and worst-case throughput30m
Calculate some periodic schedules30m
Calculating optimal periodic schedules and their latencies30m
Calculating suitable buffer sizes30m
Week
4

Week 4

1 hour to complete

One final example

1 hour to complete
1 video (Total 21 min), 5 readings
1 video
5 readings
2015 Assignment on dataflow modeling.10m
Additional dataflow exercises10m
Example of an exam at masters level (without solutions)10m
Another example of an exam (with solutions)10m
Material created by fellow students10m

Frequently Asked Questions

More questions? Visit the Learner Help Center.