Slides

The slides and the exercises are available on the Team

Video registrations of the lectures available on Adobe Connect

The records of the lectures in the virtual room, that you can find in the following links, were not post-produced and are just the registration of the lectures as they were given by the teacher to the class.

The video will be available on Adobe Connect only to the student who are required login using their User ID and password.

According to the currents laws (D.R. 341/2020 on 24/03/2020 (art. 4)): “It is forbidden to the users to register, copy, modify and share with any tool the teaching materials (registrations, slides, etc). Furthermore, it is forbidden to use the teaching material not for educational purposes as well as for any purpose not allowed by the copyright laws.”.

October 5th, 2020 (Introduction to the course: Classification of dynamical Systems, introduction to discrete event systems and formal languages)

October 7th, 2020 (Formal languages)

October 8th, 2020 (Deterministic finite automata: definition, graphical representation, generated and accepted languages)

October 12th, 2020 (Deterministic finite automata: classification of states and automata)

October 14th, 2020 (Deterministic finite automata: trim automata and complete automata; Exercise 1: problem 1)

October 15th, 2020 (Exercise 1: problems 2 and 3)

October 19th, 2020 (Exercise 1; Nondeterministic finite automata: definitions and languages)

October 21st, 2020 (Nondeterministic finite automata)

October 22nd, 2020 (Exercise 2: problem 1)

October 26th, 2020 (Mealy and Moore automata, Modular synthesis)

October 28th, 2020 (Exercise 2. Supervisory control)

October 29th, 2020 (Supervisory control)

November 2nd, 2020 (Supervisory control: language specifications)

November 4th, 2020 (Exercise 3)

November 5th, 2020 (Fault diagnosis: problem statement, the diagnoser)

November 9th, 2020 (Diagnosability analysis)

November 11th, 2020 (Exercise 4. Opacity using determinsitic finite automata: introduction, definition of current state opacity and initial state opacity)

November 12th, 2020 (Opacity using deterministic finite automata: definition of language based opacity; verification of current state opacity and initial state opacity)

November 16th, 2020 (Opacity enforcement. Exercise 5)

November 18th, 2020 (Solution of the first written examination of last year: first two problems)

November 19th, 2020 (Introduction to Petri nets)

November 23rd, 2020 (Petri nets: reachability and coverability graph; modelling with Petri nets; Petri nets properties)

November 26th, 2020 (Petri nets properties; Exercise 6: first problem)

November 30th, 2020 (Labeled Petri nets; Exercise 7: second problem)

December 2nd, 2020 (Basis markings and minimal explanations)

December 3rd, 2020 (Basis reachability graph and state estimation)

December 7th, 2020 (Exercise 7: first nine items)

December 9th, 2020 (Exercise 7: last three items; Opacity verification using labeled Petri nets)

December 10th, 2020 (Exercise 8; Fault diagnosis using labeled Petri nets)

December 14th, 2020 (Fault diagnosis using labeled Petri nets; Exercise 9)

December 16th, 2020 (Solution of the second written examination of last year)