Discrete Event Systems
Students will be able to analyze discrete event systems and design and implement supervisory control algorithms based on the automata, max plus and Petri nets theories.
- recognize discrete event systems
- explaine functioning of discrete event systems
- apply formal modelling methods of discrete event systems
- analyze structural properties of discrete event systems based on Petri net model
- develop control algorithms for discrete event systems
- analyze discrete event systems by using max-plus algebra
Forms of Teaching
problem solving exercises are part of lectures, with active participation of studentsLaboratory Work
practical implementation of acquired knowledge on the laboratory model of discrete event system
|Type||Threshold||Percent of Grade||Threshold||Percent of Grade|
|Laboratory Exercises||0 %||30 %||0 %||30 %|
|Homeworks||0 %||20 %||0 %||20 %|
|Mid Term Exam: Written||0 %||20 %||0 %|
|Final Exam: Written||0 %||30 %|
|Exam: Written||50 %||50 %|
Week by Week Schedule
- Basic properties of discrete event systems. Differences between time driven and event driven systems. Discrete states and discrete state space.
- Basics of the graph theory
- Automata and languages
- DES transition equation. Modeling and simulation of discrete event systems (DES); Static Petri nets
- Static Petri nets
- Dynamic Petri nets. Coulored Petri nets; Max plus algebra
- Max plus algebra.
- midterm exam
- String algebra; Matrix description of DES
- Matrix description of DES.
- DES analysis. Observability.
- Stability, conflicts, livelocks and deadlocks.
- DES synthesis. Controllability.
- Feedback and DES supervisory control. DES examples - transportation systems, warehouses
- final exam