Differenze

Queste sono le differenze tra la revisione selezionata e la versione attuale della pagina.

--- magistraleinformaticaeconomia:mpb:start [04/11/2026 alle 15:48 (15 ore fa)] – [Lectures] Roberto Bruni
+++ magistraleinformaticaeconomia:mpb:start [04/11/2026 alle 15:50 (15 ore fa)] (versione attuale) – [Lectures] Roberto Bruni
@@ Linea 154: / Linea 154: @@
 | 12 | Tue | 03/11 | 09:00-11:00 | C1 | Lecture 8 | BPMN key features (ctd.): artefacts, choreographies.\\ Petri nets: mathematical preliminaries, finite automata | |
 | 13 | Thu | 05/11 | 16:00-18:00 | A1 | Lecture V4 | Conformance checking: how good is my model? How good is the log? //**(Prof. Vandin)**// |  |
-| 14 |  |  |  |  | Lecture 9 | Petri nets: from automata to nets, markings, firing, occurrence graph, boundedness, coverability graph | [[http://woped.dhbw-karlsruhe.de/|Woped]] |
+| 14 | Tue | 10/11 | 09:00-11:00 | C1 | Lecture 9 | Petri nets: from automata to nets, markings, firing, occurrence graph, boundedness, coverability graph | [[http://woped.dhbw-karlsruhe.de/|Woped]] |
-| 15 |  |  |  |  | Lecture 10 | Petri nets: Liveness, place liveness, deadlock freedom |  |
+| 15 | Thu | 12/11 | 16:00-18:00 | A1 | Lecture 10 | Petri nets: Liveness, place liveness, deadlock freedom |  |
-| 16 |  |  |  |  | Lecture 11 | Petri nets as matrices: incidence matrix, Parikh vectors, Marking equation lemma, Monotonicity lemma, Boundedness lemma, Repetition lemma |  |
+| 16 | Tue | 17/11 | 09:00-11:00 | C1 | Lecture 11 | Petri nets as matrices: incidence matrix, Parikh vectors, Marking equation lemma, Monotonicity lemma, Boundedness lemma, Repetition lemma |  |
-| 17 |  |  |  |  | Lecture 12 | Workflow nets: Soundness, N*, Main theorem, Strong connectedness theorem | [[http://woped.dhbw-karlsruhe.de/|Woped]] |
+| 17 | Thu | 19/11 | 16:00-18:00 | A1 | Lecture 12 | Workflow nets: Soundness, N*, Main theorem, Strong connectedness theorem | [[http://woped.dhbw-karlsruhe.de/|Woped]] |
-| 18 |  |  |  |  | Lecture 13\\ Lecture 14 | Sound and safe WfN by construction\\ Invariants: S-invariants|  |
+| 18 | Tue | 24/11 | 09:00-11:00 | C1 | Lecture 13\\ Lecture 14 | Sound and safe WfN by construction\\ Invariants: S-invariants|  |
-| 19 |  |  |  |  | Lecture 14\\ Lecture 15 | Invariants: T-invariants\\ Structural properties: S-systems, T-systems |  |
+| 19 | Thu | 26/11 | 16:00-18:00 | A1 | Lecture 14\\ Lecture 15 | Invariants: T-invariants\\ Structural properties: S-systems, T-systems |  |
-| 20 |  |  |  |  | Lecture 16a\\ Lecture 16b | From EPC to WfN\\ From BPMN to WfN |  |
+| 20 | Tue | 01/12 | 09:00-11:00 | C1 | Lecture 16a\\ Lecture 16b | From EPC to WfN\\ From BPMN to WfN |  |
-| 21 |  |  |  |  | Lecture 17 aux\\ Lecture 17 | P vs NP: Decision problems and complexity classes\\ Structural properties: Free-choice nets |  |
+| 21 | Thu | 03/12 | 16:00-18:00 | A1 | Lecture 17 aux\\ Lecture 17 | P vs NP: Decision problems and complexity classes\\ Structural properties: Free-choice nets |  |
 | 22 |  |  |  |  | Lecture 18\\ Lecture 19 | Worflow systems: workflow modules, relaxed soundness\\ Conformance measures |  |
 | 23 |  |  |  |  | Lecture 20\\ Lecture 21 | Quantitative analysis: Cycle time, Flow analysis, Little's law\\ \\ Workflow nets diagnosis: Woflan, ProM, coverability,  (optional: error sequences) | [[http://woped.dhbw-karlsruhe.de/|Woped]]\\ [[http://www.win.tue.nl/woflan/|Woflan]]\\ [[http://www.processmining.org/prom/start|ProM]] |