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.

This information is intended exclusively for students already enrolled in this course.
If you are a new student interested in enrolling, you can find information about the course of study on the course page:

Laurea magistrale in Ingegneria e scienze informatiche - Enrollment from 2025/2026

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.

CURRICULUM TIPO:

1° Year 

ModulesCreditsTAFSSD
12
B
ING-INF/05
12
B
ING-INF/05
6
B
ING-INF/05

2° Year   activated in the A.Y. 2019/2020

ModulesCreditsTAFSSD
6
B
INF/01
6
B
ING-INF/05
Other activities
4
F
-
Final exam
24
E
-
ModulesCreditsTAFSSD
12
B
ING-INF/05
12
B
ING-INF/05
6
B
ING-INF/05
activated in the A.Y. 2019/2020
ModulesCreditsTAFSSD
6
B
INF/01
6
B
ING-INF/05
Other activities
4
F
-
Final exam
24
E
-
Modules Credits TAF SSD
Between the years: 1°- 2°

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.




S Placements in companies, public or private institutions and professional associations

Teaching code

4S02785

Credits

6

Language

Italian

Scientific Disciplinary Sector (SSD)

ING-INF/05 - INFORMATION PROCESSING SYSTEMS

Period

I semestre dal Oct 1, 2018 al Jan 31, 2019.

To show the organization of the course that includes this module, follow this link:  Course organization

Learning outcomes

The objective of the class is to describe the main 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 of the class 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: )) 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) make progress in the independent study of formal methods for discrete-event systems both for industrial applications and scientific advancement.

Prerequisites. The class is self-contained. but it assumes a mastery
of the basic notions of discrete mathematics, automata theory
and differential equations.

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 infinte).
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.

Reference texts
Author Title Publishing house Year ISBN Notes
Edward A. Lee and Sanjit A. Seshia Introduction to Embedded Systems — A Cyber-Physical Systems Approach — Second Edition (Edizione 2) MIT Press 2017 978-0-262-53381-2
Angela Di Febbraro, Alessandro Giua Sistemi ad Eventi Discreti MvGraw-Hill 2002 88-386-0863-6

Examination Methods

The exam is a written test with theoretical questions and exercises.
The exams is passed with a score higher or equal to 18/30.
To register the final grade, it is necessary to pass the exams both
of Discrete Event Systems and of Dynamic Systems.
The final grade is the average of the two.

Students with disabilities or specific learning disorders (SLD), who intend to request the adaptation of the exam, must follow the instructions given HERE

Teaching materials e documents