Search programme

​Use the search function to search amongst programmes at Chalmers. The study programme and the study programme syllabus relating to your studies are generally from the academic year you began your studies.

Syllabus for

Academic year
SSY220 - Discrete event control and optimization  
 
Syllabus adopted 2013-02-19 by Head of Programme (or corresponding)
Owner: MPSYS
7,5 Credits
Grading: TH - Five, Four, Three, Not passed
Education cycle: Second-cycle
Major subject: Automation and Mechatronics Engineering
Department: 32 - ELECTRICAL ENGINEERING


Teaching language: English
Open for exchange students
Block schedule: C

Course module   Credit distribution   Examination dates
Sp1 Sp2 Sp3 Sp4 Summer course No Sp
0108 Examination 5,0 c Grading: TH   5,0 c   24 May 2014 am V,  15 Jan 2014 pm V   27 Aug 2014 am M
0208 Laboratory 2,5 c Grading: UG   2,5 c    

In programs

MPSYS SYSTEMS, CONTROL AND MECHATRONICS, MSC PROGR, Year 1 (compulsory elective)

Examiner:

Professor  Martin Fabian



Eligibility:

For single subject courses within Chalmers programmes the same eligibility requirements apply, as to the programme(s) that the course is part of.

Course specific prerequisites

Discrete Event Systems (or comparable knowledge acquired by other means).

Aim

The course aims to give advanced knowledge about formal methods and how these may be used for reasoning about and analyzing the performance of discrete event systems. Typical applications for using formal methods are verification and synthesis of control functions for embedded systems, control of automated production systems, and communication systems. The course focuses on modeling, specification, simulation, verification, synthesis, optimization and control function implementation.

Learning outcomes (after completion of the course the student should be able to)

After completion of this course, the students should be able to:


  • Give a detailed account of different formalisms for modeling discrete event systems, especially various types of finite state machines, and Petri nets.

  • Analyse properties such as reachability, coreachability, controllability, observability using discrete mathematics.

  • Perform synthesis and optimization of control functions based on given system models and specification of desired behavior for the total closed loop system.

  • Give an account of different verification- and synthesis algorithms.

  • Present how optimization algorithms such as A* and MILP work, and use these when performing different optimization tasks.

  • Construct and implement control functions (protocols) based on industrial standards and components, for instance programmable logic controllers PLCs.
  • Content

    The course covers the following topics: Theory and practice of modeling and specification of logic and sequential behaviors. Examples of modeling formalisms include formal languages, finite state machines, Petri nets and Statecharts. Theory and practice of verification of safety and liveness properties, such as reachability, blocking, deadlock and forbidden states, through state-space search methods. Theory and practice of synthesis and optimization of control functions based on given system models and specification of desired behavior of the controlled system. Theory and practice of implementation of discrete event control functions (protocols) based on industrial standards and components, for example programmable controllers (PLCs).

    Organisation

    The course comprises lectures, exercises, and a number of assignments that address important parts of the course. These hand-in assignments involve modeling, specification, verification and synthesis. Laboratory experiments, dealing with analysis and generation of control functions laboratory equipment, are also included.

    Literature

    Martin Fabian, DECO Lecture notes

    Examination

    Examination is based on a written exam, as well as passed hand-ins and experiments.


    Page manager Published: Mon 28 Nov 2016.