Course detail
Discrete event systems
FEKT-NSDUAcad. year: 2013/2014
Discrete event systems and their typical examples, modelling, Basic modeling concepts. Petri nets, definitions, types, purpose, autonomous PN, colored PN. Sequence systems. Markov chains and processes, queueing systems.
Language of instruction
English
Number of ECTS credits
5
Mode of study
Not applicable.
Guarantor
Learning outcomes of the course unit
Student can:
- analyse behaviour of discrete event systems
- design models for simple discrete event systems
- write discrete event systems model in different representations
- compute basic statistics for queing systems
- analyse simple Markov networks
- analyse behaviour of discrete event systems
- design models for simple discrete event systems
- write discrete event systems model in different representations
- compute basic statistics for queing systems
- analyse simple Markov networks
Prerequisites
The subject knowledge on the Bachelor´s degree level is requested.
Co-requisites
Not applicable.
Planned learning activities and teaching methods
Teaching methods include lectures and computer laboratories. Knowledge is verified using tests at exercises. Students have to write three assignments during the course.
Assesment methods and criteria linked to learning outcomes
Lesson. Max. 30 points.
Examination. Max. 70 points.
Conditions for awarding the course-unit credit:
1. Active participation in exercises
2. Minimum of 10 points awarded for projects
Examination. Max. 70 points.
Conditions for awarding the course-unit credit:
1. Active participation in exercises
2. Minimum of 10 points awarded for projects
Course curriculum
Descrete event systems and models
Automata, basic concepts
Automata and language relation
Petri nets
Timed systems
Hybrid systems
Stochastic timed systems
Discrete event systems control
Discrete time Markov chains
Continuous time Markov processes
Queuing theory
Markov chains control
Discrete event systems simulation
Automata, basic concepts
Automata and language relation
Petri nets
Timed systems
Hybrid systems
Stochastic timed systems
Discrete event systems control
Discrete time Markov chains
Continuous time Markov processes
Queuing theory
Markov chains control
Discrete event systems simulation
Work placements
Not applicable.
Aims
This subject presents the field of systems with discrete character from its essence (contrary to discrete control of continuous systems). This is the question of systems of piece production, of bulk service, traffic systems etc. The subject is interested in modeling, control and optimization of behavior of discrete events. It deals in details with the formulation of the tasks of operations scheduling in computer, traffic and especially in production systems. It gives the overview of using the Witness simulation system - one of the top solutions in the field of discrete event system simulation.
Specification of controlled education, way of implementation and compensation for absences
The content and forms of instruction in the evaluated course are specified by a regulation issued by the lecturer responsible for the course and updated for every academic year.
Recommended optional programme components
Not applicable.
Prerequisites and corequisites
Not applicable.
Basic literature
Cassandras, C.G., Lafortune, S.: Introduction to Discrete Event Systems, Springer, 2007 (EN)
Recommended reading
Not applicable.
Classification of course in study plans
Type of course unit
Lecture
26 hod., optionally
Teacher / Lecturer
Syllabus
Discrete event systems and their typical examples.
Modeling of discrete event systems, purpose and basic resources. Structural and dynamic models.
Parallelism in discrete event systems, static, capacity and precedence limitations.
Graphs and nets as a basic modeling appliance. Petri nets (PN), definitions, types, purpose, PN as modeling tool.
Sequence systems and their modeling using PN, autonomous PN, colored PN.
Timing in PN, simulation of system's functionality, critical points detection in systems.
Flexible systems and their deciding.
Scheduling in systems "flow-shop","open-shop" a "job-shop", criteria function of optimality.
Task of scheduling of one machine, criteria Cmax, Fw, Lmax.
Task of scheduling of parallel machines, criteria Cmax, Fw, Lmax.
Static and predictive scheduling of type flow-shop, open-shop, job-shop.
Scheduling of operations and traffic problems solving.
Modeling of discrete event systems, purpose and basic resources. Structural and dynamic models.
Parallelism in discrete event systems, static, capacity and precedence limitations.
Graphs and nets as a basic modeling appliance. Petri nets (PN), definitions, types, purpose, PN as modeling tool.
Sequence systems and their modeling using PN, autonomous PN, colored PN.
Timing in PN, simulation of system's functionality, critical points detection in systems.
Flexible systems and their deciding.
Scheduling in systems "flow-shop","open-shop" a "job-shop", criteria function of optimality.
Task of scheduling of one machine, criteria Cmax, Fw, Lmax.
Task of scheduling of parallel machines, criteria Cmax, Fw, Lmax.
Static and predictive scheduling of type flow-shop, open-shop, job-shop.
Scheduling of operations and traffic problems solving.
Exercise in computer lab
26 hod., compulsory
Teacher / Lecturer
Syllabus
Discrete event systems in typical examples.
Modeling of discrete event systems, tools for structural and dynamic modeling.
Connection between Models–PLC B&R–PC in real-time
Basic modeling appliance.
Petri nets practical examples I.-V.
Task of scheduling - definition and problem analysis.
Task of scheduling - problem solving.
Task of scheduling of one machine, criteria Cmax, Fw, Lmax.
Task of scheduling of parallel machines, criteria Cmax, Fw, Lmax.
Task of scheduling of type flow-shop, open-shop, job-shop.
Comercial products for for task of scheduling.
Modeling of discrete event systems, tools for structural and dynamic modeling.
Connection between Models–PLC B&R–PC in real-time
Basic modeling appliance.
Petri nets practical examples I.-V.
Task of scheduling - definition and problem analysis.
Task of scheduling - problem solving.
Task of scheduling of one machine, criteria Cmax, Fw, Lmax.
Task of scheduling of parallel machines, criteria Cmax, Fw, Lmax.
Task of scheduling of type flow-shop, open-shop, job-shop.
Comercial products for for task of scheduling.