| Entrambe le parti precedenti la revisioneRevisione precedenteProssima revisione | Revisione precedente |
| magistraleinformaticaeconomia:mpb:start [03/12/2024 alle 11:21 (4 mesi fa)] – [Lectures (second half)] Roberto Bruni | magistraleinformaticaeconomia:mpb:start [12/12/2024 alle 14:01 (4 mesi fa)] (versione attuale) – [Lectures (second half)] Roberto Bruni |
|---|
| ---- | ---- |
| |
| ==== Oral Exams: schedule ==== | |
| |
| ^ Date ^^ Time ^ Name ^ Place ^ | |
| | **//day//** | **//date//** | //time// | session start | Microsoft Teams | | |
| | | **//date//** | | //name// | Project: //Pending/Approved// | | |
| | | | //time// | session end | | | |
| |
| -- | |
| |
| |
| ==== Announcements ==== | ==== Announcements ==== |
| |
| | * Due to a general strike, the lecture of **Friday November 29th 2024 has been canceled**. The missed lecture will be recovered on **Monday 09/12 (11:00-13:00, room M1)** |
| * Due to conflicting schedules with other classrooms for the large majority of students, the lecture scheduled on **Tuesday November 5th at 9:00-11:00 in room M1** is canceled. As the Tuesday slot looks not feasible, the three missed lectures will be recovered on **Monday 18/11, 25/11 and 2/12 (11:00-13:00, room M1)**. | * Due to conflicting schedules with other classrooms for the large majority of students, the lecture scheduled on **Tuesday November 5th at 9:00-11:00 in room M1** is canceled. As the Tuesday slot looks not feasible, the three missed lectures will be recovered on **Monday 18/11, 25/11 and 2/12 (11:00-13:00, room M1)**. |
| * Due to a general strike, the lecture of **Thursday October 31st 2024 will be canceled**. Since **November 1st is national holiday**, the next lecture (after today 25/10 in L1 16:00-18:00) will be held on **Tuesday November 5th at 9:00-11:00 in room M1**. | * Due to a general strike, the lecture of **Thursday October 31st 2024 will be canceled**. Since **November 1st is national holiday**, the next lecture (after today 25/10 in L1 16:00-18:00) will be held on **Tuesday November 5th at 9:00-11:00 in room M1**. |
| ^ N ^ Date ^ Time ^ Room ^ Lecture notes ^ Topics ^ Links ^ | ^ N ^ Date ^ Time ^ Room ^ Lecture notes ^ Topics ^ Links ^ |
| | 13 | 15/11 | 16:00-18:00 | L1 | {{ :magistraleinformaticaeconomia:mpb:10-properties-2024.pdf |Lecture 10}} (2nd part)\\ {{ :magistraleinformaticaeconomia:mpb:11-net-matrices-2024.pdf |Lecture 11}} (1st part) | Behavioural properties:\\ //deadlock freedom, boundedness, safeness, home marking, cyclicity//\\ \\ Structural properties:\\ //weak and strong connectedness, S-systems, T-systems, free-choice nets//\\ \\ Nets as matrices:\\ //markings as vectors, incidence matrices, Parikh vectors, marking equation lemma, monotonicity lemma// | | | | 13 | 15/11 | 16:00-18:00 | L1 | {{ :magistraleinformaticaeconomia:mpb:10-properties-2024.pdf |Lecture 10}} (2nd part)\\ {{ :magistraleinformaticaeconomia:mpb:11-net-matrices-2024.pdf |Lecture 11}} (1st part) | Behavioural properties:\\ //deadlock freedom, boundedness, safeness, home marking, cyclicity//\\ \\ Structural properties:\\ //weak and strong connectedness, S-systems, T-systems, free-choice nets//\\ \\ Nets as matrices:\\ //markings as vectors, incidence matrices, Parikh vectors, marking equation lemma, monotonicity lemma// | | |
| | 14 | 18/11 | 11:00-13:00 | M1 | Exercises (from Lectures 10)\\ \\ {{ :magistraleinformaticaeconomia:mpb:11-net-matrices-2024.pdf |Lecture 11}} (2nd part)\\ {{ :magistraleinformaticaeconomia:mpb:12-invariants-2024.pdf |Lecture 12}} (1st part) | Exercises:\\ //behavioural properties, structural properties//\\ \\ Nets as matrices:\\ //monotonicity lemma 2 and a corollary, boundedness lemma, repetition lemma//\\ \\ Invariants:\\ //S-invariants, fundamental property of S-invariants, alternative characterization of S-invariant, support, positive S-invariants// | | | | 14 | 18/11 | 11:00-13:00 | M1 | Exercises (from Lecture 10)\\ \\ {{ :magistraleinformaticaeconomia:mpb:11-net-matrices-2024.pdf |Lecture 11}} (2nd part)\\ {{ :magistraleinformaticaeconomia:mpb:12-invariants-2024.pdf |Lecture 12}} (1st part) | Exercises:\\ //behavioural properties, structural properties//\\ \\ Nets as matrices:\\ //monotonicity lemma 2 and a corollary, boundedness lemma, repetition lemma//\\ \\ Invariants:\\ //S-invariants, fundamental property of S-invariants, alternative characterization of S-invariant, support, positive S-invariants// | | |
| | 15 | 21/11 | 16:00-18:00 | L1 | {{ :magistraleinformaticaeconomia:mpb:12-invariants-2024.pdf |Lecture 12}} (2nd part)\\ Exercises (from Lecture 12)\\ \\ {{ :magistraleinformaticaeconomia:mpb:13-workflow-nets-2024.pdf |Lecture 13}} (1st part) | Invariants:\\ //S-invariants and boundedness, S-invariants and liveness, S-invariants and reachability, T-invariants, fundamental property of T-invariants, alternative characterization of T-invariants, reproduction lemma, about liveness and boundedness, two connectedness theorems//\\ \\ Exercises:\\ //invariants//\\ \\ Workflow nets:\\ //definition, syntax sugar, subprocesses, control flow aspects// | | | | 15 | 21/11 | 16:00-18:00 | L1 | {{ :magistraleinformaticaeconomia:mpb:12-invariants-2024.pdf |Lecture 12}} (2nd part)\\ Exercises (from Lecture 12)\\ \\ {{ :magistraleinformaticaeconomia:mpb:13-workflow-nets-2024.pdf |Lecture 13}} (1st part) | Invariants:\\ //S-invariants and boundedness, S-invariants and liveness, S-invariants and reachability, T-invariants, fundamental property of T-invariants, alternative characterization of T-invariants, reproduction lemma, about liveness and boundedness, two connectedness theorems//\\ \\ Exercises:\\ //invariants//\\ \\ Workflow nets:\\ //definition, syntax sugar, subprocesses, control flow aspects// | | |
| | 16 | 22/11 | 16:00-18:00 | L1 | {{ :magistraleinformaticaeconomia:mpb:13-workflow-nets-2024.pdf |Lecture 13}} (2nd part)\\ {{ :magistraleinformaticaeconomia:mpb:14-wfnets-analysis-2024.pdf |Lecture 14}} (1st part) | Workflow nets:\\ //triggers//\\ \\ Exercise:\\ //modelling with workflow nets//\\ \\ Analysis of workflow nets:\\ //structural analysis, activity analysis, token analysis, net analysis, verification and validation, reachability analysis, bags, coverability graph, soundness, N*// | [[http://woped.dhbw-karlsruhe.de/|Woped]] | | | 16 | 22/11 | 16:00-18:00 | L1 | {{ :magistraleinformaticaeconomia:mpb:13-workflow-nets-2024.pdf |Lecture 13}} (2nd part)\\ {{ :magistraleinformaticaeconomia:mpb:14-wfnets-analysis-2024.pdf |Lecture 14}} (1st part) | Workflow nets:\\ //triggers//\\ \\ Exercise:\\ //modelling with workflow nets//\\ \\ Analysis of workflow nets:\\ //structural analysis, activity analysis, token analysis, net analysis, verification and validation, reachability analysis, bags, coverability graph, soundness, N*// | [[http://woped.dhbw-karlsruhe.de/|Woped]] | |
| | 17 | 25/11 | 11:00-13:00 | M1 | Exercises (from Lectures 13 and 14)\\ \\ {{ :magistraleinformaticaeconomia:mpb:14-wfnets-analysis-2024.pdf |Lecture 14}} (2nd part)\\ {{ :magistraleinformaticaeconomia:mpb:15-wfnets-construction-2024.pdf |Lecture 15}}\\ Exercises (from Lecture 15) | Exercises:\\ //workflow nets and soundeness, soundness by construction//\\ \\ Analysis of workflow nets:\\ //main soundness theorem, strong connectedness of N*//\\ \\ Safe Workflow nets:\\ //soundness (and safeness) by construction// | [[http://woped.dhbw-karlsruhe.de/|Woped]] | | | 17 | 25/11 | 11:00-13:00 | M1 | Exercises (from Lectures 13 and 14)\\ \\ {{ :magistraleinformaticaeconomia:mpb:14-wfnets-analysis-2024.pdf |Lecture 14}} (2nd part)\\ {{ :magistraleinformaticaeconomia:mpb:15-wfnets-construction-2024.pdf |Lecture 15}}\\ Exercises (from Lecture 15) | Exercises:\\ //workflow nets and soundeness, soundness by construction//\\ \\ Analysis of workflow nets:\\ //main soundness theorem, strong connectedness of N*//\\ \\ Safe Workflow nets:\\ //soundness (and safeness) by construction// | [[http://woped.dhbw-karlsruhe.de/|Woped]] | |
| | 18 | 28/11 | 16:00-18:00 | L1 | Exercises (from Lectures 14)\\ \\ {{ :magistraleinformaticaeconomia:mpb:16-s-systems-2024.pdf |Lecture 16}}\\ Exercises (from Lecture 16)\\ \\ {{ :magistraleinformaticaeconomia:mpb:17-t-systems-short-2024.pdf |Lecture 17}}\\ Exercises (from Lecture 17)\\ \\ {{ :magistraleinformaticaeconomia:mpb:18-aux-p-np-short-2024.pdf |A note on P and NP}} (optional reading) | S-systems:\\ //fundamental property of S-systems, S-invariants of S-nets, liveness theorem, reachability lemma, reachability theorem, boundedness theorem, workflow S-nets//\\ \\ T-systems:\\ //circuits and token count on a circuit, fundamental property of T-systems, T-invariants of T-nets, boundedness in strongly connected T-systems, liveness theorem for T-systems, workflow T-nets//\\ \\ Decision problems and computational complexity (optional reading)\\ \\ Exercises:\\ //S-nets properties, T-nets properties// | | | | 18 | 28/11 | 16:00-18:00 | L1 | Exercises (from Lecture 14)\\ \\ {{ :magistraleinformaticaeconomia:mpb:16-s-systems-2024.pdf |Lecture 16}}\\ Exercises (from Lecture 16)\\ \\ {{ :magistraleinformaticaeconomia:mpb:17-t-systems-short-2024.pdf |Lecture 17}}\\ Exercises (from Lecture 17)\\ \\ {{ :magistraleinformaticaeconomia:mpb:18-aux-p-np-short-2024.pdf |A note on P and NP}} (optional reading) | S-systems:\\ //fundamental property of S-systems, S-invariants of S-nets, liveness theorem, reachability lemma, reachability theorem, boundedness theorem, workflow S-nets//\\ \\ T-systems:\\ //circuits and token count on a circuit, fundamental property of T-systems, T-invariants of T-nets, boundedness in strongly connected T-systems, liveness theorem for T-systems, workflow T-nets//\\ \\ Decision problems and computational complexity (optional reading)\\ \\ Exercises:\\ //S-nets properties, T-nets properties// | | |
| | 19 | 02/12 | 11:00-13:00 | M1 | {{ :magistraleinformaticaeconomia:mpb:18-free-choice-new-2024.pdf |Lecture 18}}\\ {{ :magistraleinformaticaeconomia:mpb:19-epc-analysis-2024.pdf |Lecture 19}} (1st part) | Free-choice nets:\\ //Fundamental property of free-choice nets, place-liveness = liveness in f.c. nets, Commoner's theorem, Rank theorem, clusters, stable sets, siphons, proper siphons, fundamental property of siphons, siphons and liveness, traps, Commoner's theorem and its complexity issues, Rank theorem and its complexity issues//\\ \\ EPC:\\ //soundness analysis, from EPC to wf nets, net fragments, dummy style, fusion style, unique start, unique end, three transformations//\\ \\ Exercises:\\ //workflow net analysis with Woped, properties of free-choice nets, workflow systems// | [[http://woped.dhbw-karlsruhe.de/|Woped]] | | | 19 | 02/12 | 11:00-13:00 | M1 | {{ :magistraleinformaticaeconomia:mpb:18-free-choice-new-2024.pdf |Lecture 18}}\\ {{ :magistraleinformaticaeconomia:mpb:19-epc-analysis-2024.pdf |Lecture 19}} (1st part)\\ \\ Exercises (from Lecture 17) | Free-choice nets:\\ //Fundamental property of free-choice nets, place-liveness = liveness in f.c. nets, Commoner's theorem, Rank theorem, clusters, stable sets, siphons, proper siphons, fundamental property of siphons, siphons and liveness, traps, Commoner's theorem and its complexity issues, Rank theorem and its complexity issues//\\ \\ EPC:\\ //soundness analysis, from EPC to wf nets, net fragments, dummy style, fusion style, unique start, unique end, three transformations//\\ \\ Exercises:\\ //workflow net analysis with Woped, properties of free-choice nets, workflow systems// | [[http://woped.dhbw-karlsruhe.de/|Woped]] | |
| | 20 | 05/12 | 16:00-18:00 | L1 | Exercises (from Lecture 18)\\ \\ Lecture 19 (2nd part)\\ Lecture 20 | Exercises:\\ //free-choice nets//\\ \\ EPC:\\ //semantics ambiguities, relaxed sound nets, relaxed sound EPC diagrams, from restricted EPC diagrams to f.c. nets, problems with (X)OR joins, OR join policies (wfa, fc, et), from decorated EPC diagrams to nets//\\ \\ Workflow systems:\\ //I/O interfaces, workflow modules, stuctural compatibility, workflow system, weak soundness// | [[https://online.visual-paradigm.com/diagrams/features/epc-diagram-tool/|VP]]\\ [[http://www.yworks.com/en/products_yed_about.html|yEd]]\\ [[http://woped.dhbw-karlsruhe.de/|Woped]] | | | 20 | 05/12 | 16:00-18:00 | L1 | Exercises (from Lecture 18)\\ \\ {{ :magistraleinformaticaeconomia:mpb:19-epc-analysis-2024.pdf |Lecture 19}} (2nd part)\\ {{ :magistraleinformaticaeconomia:mpb:20-workflow-systems-2024.pdf |Lecture 20}} | Exercises:\\ //free-choice nets, clusters, siphons, traps, SAT encoding//\\ \\ EPC:\\ //semantics ambiguities, relaxed sound nets, relaxed sound EPC diagrams, from restricted EPC diagrams to f.c. nets, problems with (X)OR joins, OR join policies (wfa, fc, et), from decorated EPC diagrams to nets//\\ \\ Workflow systems:\\ //I/O interfaces, workflow modules, stuctural compatibility, workflow system, weak soundness// | [[https://online.visual-paradigm.com/diagrams/features/epc-diagram-tool/|VP]]\\ [[http://www.yworks.com/en/products_yed_about.html|yEd]]\\ [[http://woped.dhbw-karlsruhe.de/|Woped]] | |
| | 21 | | 16:00-18:00 | L1 | Exercises (from Lectures 19, 20)\\ Lecture 21 (2nd part)\\ Lecture 22 (1st part) | Exercises:\\ //EPC analysis, workflow systems//\\ \\ BPMN:\\ //from BPMN diagrams to nets//\\ \\ Diagnosis of Workflow nets:\\ //Woped, S-components, S-cover, sound f.c wf nets are safe, TP-handles, PT-handles, well-handled nets, well-structured wf nets// | [[http://www.yworks.com/en/products_yed_about.html|yEd]]\\ [[http://bpmn.sourceforge.net/|Yaoqiang]]\\ [[http://bpmn.io/|BPMN.io]]\\ [[https://camunda.com/platform/modeler/|Camunda]]\\ [[https://www.bizagi.com/platform/modeler|Bizagi]]\\ [[https://online.visual-paradigm.com/diagrams|VP]]\\ [[http://woped.dhbw-karlsruhe.de/|Woped]] | | | 21 | 06/12 | 16:00-18:00 | L1 | Exercises (from Lecture 20)\\ \\ {{ :magistraleinformaticaeconomia:mpb:21-bpmn-analysis-2024.pdf |Lecture 21}}\\ {{ :magistraleinformaticaeconomia:mpb:22-wfnets-diagnosis-short-2024.pdf |Lecture 22}} | Exercises:\\ //workflow systems//\\ \\ BPMN:\\ //from BPMN diagrams to nets//\\ \\ Diagnosis of Workflow nets:\\ //Woped, S-components, S-cover, sound f.c wf nets are safe, TP-handles, PT-handles, well-handled nets, well-structured wf nets, Woflan, ProM, error sequences, non-live sequences, unbounded sequences// | [[http://www.yworks.com/en/products_yed_about.html|yEd]]\\ [[http://bpmn.sourceforge.net/|Yaoqiang]]\\ [[http://bpmn.io/|BPMN.io]]\\ [[https://camunda.com/platform/modeler/|Camunda]]\\ [[https://www.bizagi.com/platform/modeler|Bizagi]]\\ [[https://online.visual-paradigm.com/diagrams|VP]]\\ \\ [[http://woped.dhbw-karlsruhe.de/|Woped]]\\ [[http://www.win.tue.nl/woflan/|Woflan]]\\ [[http://www.processmining.org/prom/start|ProM]] | |
| | 22 | | 16:00-18:00 | L1 | Lecture 22 (2nd part)\\ Lecture 23 (1st part) | Diagnosis of Workflow nets:\\ //Woflan, ProM, error sequences, non-live sequences, unbounded sequences//\\ \\ Process mining:\\ //intro, Event logs, discovery, conformance, enhancement, perspectives, play-in, play-out, replay, overfitting, underfitting, alpha-algorithm, footprint matrix, naive fitness, improved fitness// | [[http://woped.dhbw-karlsruhe.de/|Woped]]\\ [[http://www.win.tue.nl/woflan/|Woflan]]\\ [[http://www.processmining.org/prom/start|ProM]] | | | 22 | 09/12 | 11:00-13:00 | M1 | Exercises (from Lectures 19 and 22)\\ \\ {{ :magistraleinformaticaeconomia:mpb:23-mining-new-2024.pdf |Lecture 23}} | Exercises:\\ //EPC analysis//\\ \\ Process mining:\\ //intro, Event logs, discovery, conformance, enhancement, perspectives, play-in, play-out, replay, overfitting, underfitting, alpha-algorithm, footprint matrix, naive fitness, improved fitness, comparing footprints// | | |
| | 23 | | 16:00-18:00 | L1 | Lecture 23 (2nd part)\\ Lecture 24 | Exercises:\\ //workflow nets analysis//\\ \\ Process mining:\\ //comparing footprints//\\ \\ Quantitative analysis:\\ //Performance dimensions and objectives, KPI, cyle time analysis, Little's law, cost analysis//\\ \\ A final note (with project instructions) | | | | 23 | 12/12 | 16:00-18:00 | L1 | Exercises (from Lecture 23)\\ \\ {{ :magistraleinformaticaeconomia:mpb:24-quantitative-analysis-2024.pdf |Lecture 24}} | Exercises:\\ //process discovery, peformance analysis//\\ \\ Quantitative analysis:\\ //Performance dimensions and objectives, KPI, cyle time analysis, Little's law, cost analysis//\\ \\ A final note (with project instructions) | | |
| | 24 | | 16:00-18:00 | L1 | Questions and answers | | | | | 24 | 13/12 | 16:00-18:00 | Teacher's office | Questions and answers | | | |
| | end | | | | | | | | | end | | | | | | | |
| |
