It gives methodological and operational knowledge necessary to evaluate the procedures of supervisor control of the operations in the coordinated automatic manufacturing systems
Curriculum
teacher profile teaching materials
Course Contents
The course introduces two main approaches to discrete-event system modeling:
1. Graphical Models – Petri Nets: introduction to Petri nets, with particular emphasis on logical and timed Petri nets, for representing and analyzing system behavior.
Introduction to Petri Nets
Fundamental properties: boundedness, liveness, and reversibility.
Graphical representation: reachability and coverability graphs.
Algebraic representation: P-invariants and T-invariants.
Modeling with Petri Nets.
2. Mathematical Models – Queueing Systems and Networks: introduction to the fundamental concepts of queueing theory and analysis of the main queueing models:
- M/M/1 systems;
- M/M/1/K systems;
- M/M/s systems;
- Open queueing networks;
- Closed queueing networks.
Programme
The course aims to provide students with the knowledge and tools required to analyze and model discrete-event systems using graphical and mathematical models. By the end of the course, students will be able to represent, analyze, and study the behavior of such systems, selecting the most appropriate modeling approach according to the characteristics of the problem.Course Contents
The course introduces two main approaches to discrete-event system modeling:
1. Graphical Models – Petri Nets: introduction to Petri nets, with particular emphasis on logical and timed Petri nets, for representing and analyzing system behavior.
Introduction to Petri Nets
Fundamental properties: boundedness, liveness, and reversibility.
Graphical representation: reachability and coverability graphs.
Algebraic representation: P-invariants and T-invariants.
Modeling with Petri Nets.
2. Mathematical Models – Queueing Systems and Networks: introduction to the fundamental concepts of queueing theory and analysis of the main queueing models:
- M/M/1 systems;
- M/M/1/K systems;
- M/M/s systems;
- Open queueing networks;
- Closed queueing networks.
Prerequisiti
NoneCore Documentation
Teacher's material uploaded to the teamsReference Bibliography
Teacher's material uploaded to the teamsAttendance
classroom and on lineType of evaluation
There will be ongoing tests (exemptions), a written test (theoretical and practical) and a possible oral test teacher profile teaching materials
Course Contents
The course introduces two main approaches to discrete-event system modeling:
1. Graphical Models – Petri Nets: introduction to Petri nets, with particular emphasis on logical and timed Petri nets, for representing and analyzing system behavior.
Introduction to Petri Nets
Fundamental properties: boundedness, liveness, and reversibility.
Graphical representation: reachability and coverability graphs.
Algebraic representation: P-invariants and T-invariants.
Modeling with Petri Nets.
2. Mathematical Models – Queueing Systems and Networks: introduction to the fundamental concepts of queueing theory and analysis of the main queueing models:
- M/M/1 systems;
- M/M/1/K systems;
- M/M/s systems;
- Open queueing networks;
- Closed queueing networks.
Mutuazione: 20801782 ANALISI DEI SISTEMI AD EVENTI in Ingegneria Informatica e dell'Intelligenza Artificiale L-8 R ADACHER LUDOVICA
Programme
The course aims to provide students with the knowledge and tools required to analyze and model discrete-event systems using graphical and mathematical models. By the end of the course, students will be able to represent, analyze, and study the behavior of such systems, selecting the most appropriate modeling approach according to the characteristics of the problem.Course Contents
The course introduces two main approaches to discrete-event system modeling:
1. Graphical Models – Petri Nets: introduction to Petri nets, with particular emphasis on logical and timed Petri nets, for representing and analyzing system behavior.
Introduction to Petri Nets
Fundamental properties: boundedness, liveness, and reversibility.
Graphical representation: reachability and coverability graphs.
Algebraic representation: P-invariants and T-invariants.
Modeling with Petri Nets.
2. Mathematical Models – Queueing Systems and Networks: introduction to the fundamental concepts of queueing theory and analysis of the main queueing models:
- M/M/1 systems;
- M/M/1/K systems;
- M/M/s systems;
- Open queueing networks;
- Closed queueing networks.
Prerequisiti
NoneCore Documentation
Teacher's material uploaded to the teamsReference Bibliography
Teacher's material uploaded to the teamsAttendance
classroom and on lineType of evaluation
There will be ongoing tests (exemptions), a written test (theoretical and practical) and a possible oral test teacher profile teaching materials
Course Contents
The course introduces two main approaches to discrete-event system modeling:
1. Graphical Models – Petri Nets: introduction to Petri nets, with particular emphasis on logical and timed Petri nets, for representing and analyzing system behavior.
Introduction to Petri Nets
Fundamental properties: boundedness, liveness, and reversibility.
Graphical representation: reachability and coverability graphs.
Algebraic representation: P-invariants and T-invariants.
Modeling with Petri Nets.
2. Mathematical Models – Queueing Systems and Networks: introduction to the fundamental concepts of queueing theory and analysis of the main queueing models:
- M/M/1 systems;
- M/M/1/K systems;
- M/M/s systems;
- Open queueing networks;
- Closed queueing networks.
Mutuazione: 20801782 ANALISI DEI SISTEMI AD EVENTI in Ingegneria Informatica e dell'Intelligenza Artificiale L-8 R ADACHER LUDOVICA
Programme
The course aims to provide students with the knowledge and tools required to analyze and model discrete-event systems using graphical and mathematical models. By the end of the course, students will be able to represent, analyze, and study the behavior of such systems, selecting the most appropriate modeling approach according to the characteristics of the problem.Course Contents
The course introduces two main approaches to discrete-event system modeling:
1. Graphical Models – Petri Nets: introduction to Petri nets, with particular emphasis on logical and timed Petri nets, for representing and analyzing system behavior.
Introduction to Petri Nets
Fundamental properties: boundedness, liveness, and reversibility.
Graphical representation: reachability and coverability graphs.
Algebraic representation: P-invariants and T-invariants.
Modeling with Petri Nets.
2. Mathematical Models – Queueing Systems and Networks: introduction to the fundamental concepts of queueing theory and analysis of the main queueing models:
- M/M/1 systems;
- M/M/1/K systems;
- M/M/s systems;
- Open queueing networks;
- Closed queueing networks.
Prerequisiti
NoneCore Documentation
Teacher's material uploaded to the teamsReference Bibliography
Teacher's material uploaded to the teamsAttendance
classroom and on lineType of evaluation
There will be ongoing tests (exemptions), a written test (theoretical and practical) and a possible oral test