Studying at the University of Verona
Here you can find information on the organisational aspects of the Programme, lecture timetables, learning activities and useful contact details for your time at the University, from enrolment to graduation.
Study Plan
The Study Plan includes all modules, teaching and learning activities that each student will need to undertake during their time at the University.
Please select your Study Plan based on your enrollment year.
1° Year
Modules | Credits | TAF | SSD |
---|
Compulsory activities for Smart Systems & Data Analytics
Compulsory activities for Embedded & Iot Systems
2° Year activated in the A.Y. 2024/2025
Modules | Credits | TAF | SSD |
---|
Compulsory activities for Embedded & Iot Systems
Compulsory activities for Robotics Systems
Compulsory activities for Smart Systems & Data Analytics
Modules | Credits | TAF | SSD |
---|
Compulsory activities for Smart Systems & Data Analytics
Compulsory activities for Embedded & Iot Systems
Modules | Credits | TAF | SSD |
---|
Compulsory activities for Embedded & Iot Systems
Compulsory activities for Robotics Systems
Compulsory activities for Smart Systems & Data Analytics
Modules | Credits | TAF | SSD |
---|
3 modules among the following (Computer vision and Human computer interaction 1st year only; Advanced computer architectures 2nd year only; the other courses both 1st and 2nd year. A.A. 2024/2025: Data visualization, Systems design laboratory and Electronic devices and sensors are not activated)
Legend | Type of training activity (TTA)
TAF (Type of Educational Activity) All courses and activities are classified into different types of educational activities, indicated by a letter.
Sistemi a eventi discreti e ibridi (2023/2024)
Teaching code
4S009002
Teacher
Coordinator
Credits
9
Language
English
Scientific Disciplinary Sector (SSD)
ING-INF/05 - INFORMATION PROCESSING SYSTEMS
Period
Semester 1 dal Oct 2, 2023 al Jan 26, 2024.
Courses Single
Authorized
Learning objectives
The objective of the class is to describe formal methods to specify, analyze and synthesize discrete-event systems. Such systems encompass discrete heterogeneous and concurrent components at different levels of abstraction, and may be subject to real-time constraints and interact with continuous environments both natural and artificial. At the end the student will be able to demonstrate basic expertise about formalisms and algorithms to specify, analyze and synthesize discrete-event systems according to the paradigm of model-based design. This expertise will enable the student to: i) represent discrete-event systems by means of languages, finite-state automata and machines, Petri nets, hybrid automata; ii) analyze their behaviour by formal methods (structural and behavioural, exact and approximate); iii) synthesize supervisory controllers of plants described by finite automata with uncontrollable and unobservable events; iv) analyze the behaviour of simple hybrid systems with continuous and discrete dynamics. At the end of the class the student will be able to: i) evaluate autonomously advantages and disadvantages of different choices of specification formalisms, and of algorithms for the analysis and synthesis of discrete-event systems; ii) work together with application-domain specialists to choose the formal model suitable for the specification, analysis and control of a given system; iii) carry on independent study of formal methods for discrete-event systems both for industrial applications and scientific advancement.
Prerequisites and basic notions
None.
Program
Introduction to systems theory: linear and non-linear systems,
combinational and reactive systems, causal and non-causal systems.
Discrete-event systems and state machines (finite and infinite).
Deterministic and non-deterministic finite state machines.
Composition of finite state machines.
Minimization, determinization. equivalente and containment checking of
finite state machines.
Simulation and bisimulation of finite state machines.
Finite-state controller synthesis with respect to safety and progress properties.
Models of Petri nets.
Reachability analysis of Petri nets: reachability and coverability graphs
and trees, state equations, incidence matrices.
Srtructural and behavioral properties of Petri nets.
Expressiveness of classes of Petri nets.
Supervisory control for regular automata and languages.
Existence and construction of a supervisor under partial controllability.
Existence and construction of a supervisor under partial observability.
Existence and construction of a non-blocking supervisor.
Over-approximating and under-approximatin solutions of the supervisor control prolem.
Hybrid automata: specification and behavior.
The reachibility problem for timed automata.
Bibliography
Didactic methods
Classroom lectures.
Learning assessment procedures
The exam is a written test with theoretical questions and exercises.
Evaluation criteria
Understanding of formal models and their mathematical properties to specify, analyze and control discrete event and hybrid systems.
Criteria for the composition of the final grade
The exam is passed with a score higher or equal to 18/30.
Exam language
Inglese (English).
Teaching materials e documents
-
AD-SISS-ch3_4 Specifica di macchine a stati finiti (Specification of finite state machines) (pdf, en, 519 KB, 11/1/23)
-
AD-TH-UCB01 Lezioni su sistemi e macchine a stat finiti (Lectures on systems and finite state machines)i (x-gzip, en, 3173 KB, 11/1/23)
-
DES-CL-ch1_4 Sistemi a eventi discreti e controllo supervisor (Discrete event systems and supervisory control) (x-gzip, en, 887 KB, 12/14/23)
-
RP-MESS-ch2 Introduzione alle reti di Petr (An introduction to Petri nets) (pdf, en, 294 KB, 11/23/23)
-
RP-Murata Petri nets: properties, analysis and applications (pdf, en, 2980 KB, 12/14/23)
-
RP-TV-1 Introduzione alle reti di Petri (Petri nets: introduction) (pdf, it, 380 KB, 11/23/23)
-
RP-TV-2 Reti di Petri: approfondimenti (Petri nets: advanced topics) (pdf, it, 1319 KB, 11/23/23)
-
RP-TV-4 Da sistemi di transizione a reti di Petri (From transition systems to Petri nets) (pdf, it, 1220 KB, 11/23/23)
-
SI-SISS-ch6 Specifica di automi ibridi (Specification of hybrid automata) (pdf, en, 4918 KB, 11/1/23)
-
SI-SISS-sett4 Composizione di MSF (Composition of FSMs) (pdf, en, 356 KB, 11/1/23)
-
SISS Errata Corrige Varaiya-Lee (postscript, en, 1190 KB, 11/1/23)
-
Stuzzichino (Teaser) (pdf, en, 3424 KB, 1/23/24)
-
XX-TV Temi d'esame (Past exams) (x-gzip, EU, 9011 KB, 1/23/24)