VVZ API is not affiliated with ETH Zurich. Data might be outdated or incorrect. Please view the official ETHZ Vorlesungsverzeichnis for binding information.

227-0102-00L 6 Credits BSC , MSC D-ITET , D-MAVT , D-INFK , D-MATH
You're viewing possible stale or outdated data. Please check the latest semester for more up-to-date information.

Discrete Event Systems

Lecturers & Examiners: Prof. Dr. Roger Wattenhofer, Prof. Dr. Laurent Vanbever, Prof. Dr. Lana Josipovic
Does not take place this semester.
VVZ CR n/a

Last Updated: 2026-06-01 11:31:01

Abstract

Introduction to discrete event systems. We start out by studying popular models of discrete event systems. Then we analyze discrete event systems from an average-case and from a worst-case perspective, and study verification. Topics include: Automata and Languages, Specification Models, Stochastic Discrete Event Systems, Worst-Case Event Systems, Verification, Petri Nets.

Objective

Over the past few decades the rapid evolution of computing, communication, and information technologies has brought about the proliferation of new dynamic systems. A significant part of activity in these systems is governed by operational rules designed by humans. The dynamics of these systems are characterized by asynchronous occurrences of discrete events, some controlled (e.g. hitting a keyboard key, sending a message), some not (e.g. spontaneous failure, packet loss). The mathematical arsenal centered around differential equations that has been employed in systems engineering to model and study processes governed by the laws of nature is often inadequate or inappropriate for discrete event systems. The challenge is to develop new modeling frameworks, analysis techniques, design tools, testing methods, and optimization processes for this new generation of systems. In this lecture we give an introduction to discrete event systems. We start out the course by exploring the limits of what is computable and what is not. In doing so, we will consider three distinct models of computation which are often used to model discrete event systems: finite automata, push-down automata and Turing machines (ranked in terms of expressiveness power). In the second part of the course we analyze discrete event systems. We first examine discrete event systems from an average-case perspective: we model discrete events as stochastic processes, and then apply continuous time markov chains and queueing theory for an understanding of the typical behavior of a system. Then we analyze discrete event systems from a worst-case perspective using the theory of online algorithms and adversarial queueing. In the last part of the course we introduce methods that allow to formally verify certain properties of Finite Automata and Petri Nets. These are some typical analysis questions we will look at: Do two given systems behave the same? Does a given system behave as intended? Does the system eventually enter a dangerous state?

Content

1. Regular Languages 2. Non-Regular Languages 3. Markov Chains 4. Stochastic Discrete Event Systems 5. Worst-Case Event Systems 6. Verification of Finite Automata 7. Petri Nets

Resources

Lecture Notes

Available athttps://disco.ethz.ch/courses/des/

Literature

[bertsekas] Data Networks Dimitri Bersekas, Robert Gallager Prentice Hall, 1991, ISBN: 0132009161 [borodin] Online Computation and Competitive Analysis Allan Borodin, Ran El-Yaniv. Cambridge University Press, 1998 [burch] Symbolic Model Checking J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, and L. J. Hwang Inf. Comput. 98, 2 (June 1992), pp. 142-170 [boudec] Network Calculus J.-Y. Le Boudec, P. Thiran Springer, 2001 [cassandras] Introduction to Discrete Event Systems Christos Cassandras, Stéphane Lafortune. Kluwer Academic Publishers, 1999, ISBN 0-7923-8609-4 [fiat] Online Algorithms: The State of the Art A. Fiat and G. Woeginger [hochbaum] Approximation Algorithms for NP-hard Problems (Chapter 13 by S. Irani, A. Karlin) D. Hochbaum [murata] Petri Nets: Properties, Analysis and Applications Tadao Murata Proceedings of the IEEE, vol. 99, issue 4, April 1989. pp. 541-580 [schickinger] Diskrete Strukturen (Band 2: Wahrscheinlichkeitstheorie und Statistik) T. Schickinger, A. Steger Springer, Berlin, 2001 [sipser] Introduction to the Theory of Computation Michael Sipser. PWS Publishing Company, 1996, ISBN 053494728X

Learning Materials (Links)

General Information

Language
English
Levels
BSC , MSC
Frequency
Yearly recurring

Examination

Type
session examination
Mode
written 120 minutes
Aids
Any kind of document is allowed (script, slides, own notes, exercises, books). NOT allowed is any electronic device (pocket calculator, mobile phone, laptop)!

Course Components

Type Title Time & Place Hours
lecture with exercise Discrete Event Systems
Does not take place this semester.
No time listed 4 h weekly

Offered In

  • Rechnergestützte Wissenschaften Bachelor
    • Wahlfächer (Von den angebotenen Wahlfächern müssen mindestens zwei Lerneinheiten erfolgreich abgeschlossen werden.)
  • Elektrotechnik und Informationstechnologie Bachelor
  • Rechnergestützte Wissenschaften Master
    • Wahlfächer (Von den angebotenen Wahlfächern müssen mindestens zwei Lerneinheiten erfolgreich abgeschlossen werden. Als Wahlfächer für Rechnergestützte Wissenschaften Master gelten automatisch (ohne Anrechnungsgesuch) auch alle Kernfächer/Vertiefungsfächer (aber nicht Wahlfächer!) aus folgenden Studiengängen: Informatik Master Mathematik Master Physik Master Elektrotechnik und Informationstechnologie Master Data Science Master Robotics, Systems and Control Master Statistik Master Neural Systems and Computation Master gemäss den angegebenen Abschnittsreferenzen.)
  • Elektrotechnik und Informationstechnologie Master
    • 01 - Fächer der Vertiefungen
      • Vertiefung: Computers and Networks (The core courses and specialisation courses below are a selection for students who wish to specialise in the area of "Computers and Networks", see . The individual study plan is subject to the tutor's approval.)
        • Kernfächer (These core courses are particularly recommended for the field of "Computers and Networks". You may choose core courses form other fields in agreement with your tutor. A minimum of 24 credits must be obtained from core courses during the MSc EEIT.)
          • Foundation Core Courses (Fundamentals at bachelor level, for master students who need to strengthen or refresh their background in the area.)
      • Vertiefung: Systems and Control (The core courses and specialisation courses below are a selection for students who wish to specialise in the area of "Systems and Control", see . The individual study plan is subject to the tutor's approval.)
        • Vertiefungsfächer (These specialisation courses are particularly recommended for the area of "Systems and Control", but you are free to choose courses from any other field in agreement with your tutor. Semester / Research Projects are not allowed in this category. A minimum of 40 credits must be obtained from specialisation courses during the Master's Programme.)
      • Vertiefung: Communication (The core courses and specialisation courses below are a selection for students who wish to specialise in the area of "Communication", see . The individual study plan is subject to the tutor's approval.)
        • Vertiefungsfächer (These specialisation courses are particularly recommended for the area of "Communication", but you are free to choose courses from any other field in agreement with your tutor. Semester / Research Projects are not allowed in this category. A minimum of 40 credits must be obtained from specialisation courses during the Master's Programme.)
  • Robotics, Systems and Control Master