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.
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.
|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|
The exam is a written test with theoretical questions and exercises.
The exams is passed with a score higher or equal to 18/30.