DidaWiki

Strumenti Utente

Strumenti Sito

Ti trovi qui: DidaWiki » Corso di Laurea Magistrale in Informatica per l'Economia e per l'Azienda » Business Processes Modeling
magistraleinformaticaeconomia:mpb:start

Differenze

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

Link a questa pagina di confronto

Entrambe le parti precedenti la revisioneRevisione precedente
magistraleinformaticaeconomia:mpb:start [12/09/2026 alle 06:42 (44 ore fa)] – [Business Processes Modeling] Roberto Brunimagistraleinformaticaeconomia:mpb:start [12/09/2026 alle 06:46 (43 ore fa)] (versione attuale) – [Lectures] Roberto Bruni
Linea 135: Linea 135:
 | 2 | Thu | 17/09 | 16:00-18:00 | A1 | Lecture 2 | Introduction to Business Processes:\\ //Taylorism, work units, processes, terminology, organizational structures, process orientation and reengineering, visual notations// |  | | 2 | Thu | 17/09 | 16:00-18:00 | A1 | Lecture 2 | Introduction to Business Processes:\\ //Taylorism, work units, processes, terminology, organizational structures, process orientation and reengineering, visual notations// |  |
 | 3 | Tue | 22/09 | 09:00-11:00 | L1 | Lecture 3 | Exercises:\\ //Alice-Bob car selling scenario//\\ \\ Examples:\\ //Orchestration diagrams, collaboration diagrams, choreography diagrams// |  | | 3 | Tue | 22/09 | 09:00-11:00 | L1 | Lecture 3 | Exercises:\\ //Alice-Bob car selling scenario//\\ \\ Examples:\\ //Orchestration diagrams, collaboration diagrams, choreography diagrams// |  |
-| 4 | Thu | 24/09 | 16:00-18:00 | A1 | Lecture V1 | Introduction to Process Mining with hands-on tutorial on Fluxicon Disco //**(Prof. Vandin)**// | [[https://fluxicon.com/disco/|Disco]] | +| 4 | Thu | 24/09 | 16:00-18:00 | A1 | Lecture 4 | Informal intro to Workflow nets:\\ //Petri nets basics, workflow net definition, WoPeD tool, syntax sugar, subprocesses, control flow aspects, triggers, modelling with workflow nets// | [[http://woped.dhbw-karlsruhe.de/|Woped]] | 
-| 5 | Tue | 29/09 | 09:00-11:00 | L1 | Lecture 4 | Informal intro to Workflow nets:\\ //Petri nets basics, workflow net definition, WoPeD tool, syntax sugar, subprocesses, control flow aspects, triggers, modelling with workflow nets// | [[http://woped.dhbw-karlsruhe.de/|Woped]] | +| 5 | Tue | 29/09 | 09:00-11:00 | L1 | Lecture 5 | Process mining:\\ //event logs, discovery, conformance, enhancement, perspectives, play-in, play-out, replay, overfitting, underfitting, footprint matrix, alpha-algorithm// |  | 
-| 6 | Thu | 01/10 | 16:00-18:00 | A1 | Lecture 5 | Process mining:\\ //event logs, discovery, conformance, enhancement, perspectives, play-in, play-out, replay, overfitting, underfitting, footprint matrix, alpha-algorithm// |  |+| 6 | Thu | 01/10 | 16:00-18:00 | A1 | Lecture V1 | Introduction to Process Mining with hands-on tutorial on Fluxicon Disco //**(Prof. Vandin)**// | [[https://fluxicon.com/disco/|Disco]] |
 | 7 | Tue | 06/10 | 09:00-11:00 | L1 | Lecture V2 | The Python library for Process Mining: PM4PY. Overview to event logs analysis, process discovery, and conformance checking. (a practitioner perspective) //**(Prof. Vandin)**// |  | | 7 | Tue | 06/10 | 09:00-11:00 | L1 | Lecture V2 | The Python library for Process Mining: PM4PY. Overview to event logs analysis, process discovery, and conformance checking. (a practitioner perspective) //**(Prof. Vandin)**// |  |
 | 8 | Thu | 08/10 | 16:00-18:00 | A1 | Lecture V3 | Formal introduction to dependency graphs and to the heuristic miner. Footprint-based conformance checking. //**(Prof. Vandin)**// |  | | 8 | Thu | 08/10 | 16:00-18:00 | A1 | Lecture V3 | Formal introduction to dependency graphs and to the heuristic miner. Footprint-based conformance checking. //**(Prof. Vandin)**// |  |
 | 9 | Tue | 13/10 | 09:00-11:00 | L1 | Lecture 6 | Orchestration, choreography, collaboration diagrams| [[https://online.visual-paradigm.com/diagrams/features/epc-diagram-tool/|VP]]\\ [[https://ariscommunity.com/aris-express|ARIS Express]]\\ [[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]] | | 9 | Tue | 13/10 | 09:00-11:00 | L1 | Lecture 6 | Orchestration, choreography, collaboration diagrams| [[https://online.visual-paradigm.com/diagrams/features/epc-diagram-tool/|VP]]\\ [[https://ariscommunity.com/aris-express|ARIS Express]]\\ [[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]] |
-| 10 | Thu | 15/10 | 16:00-18:00 | A1 | Lecture 7a | EPC and BPMN guidelines|  | +| 10 | Thu | 15/10 | 16:00-18:00 | A1 | Lecture V4 | Conformance checking: how good is my model? How good is the log? //**(Prof. Vandin)**// |  | 
-| 11 | Tue | 20/10 | 09:00-11:00 | L1 | Lecture 7b | BPMN key features |  | +| 11 | Tue | 20/10 | 09:00-11:00 | L1 | Lecture 7a | EPC and BPMN guidelines |  | 
-| 12 | Thu | 22/10 | 16:00-18:00 | A1 | Lecture 8 | Petri nets: finite automata, nets, markings, firing |  | +| 12 | Thu | 22/10 | 16:00-18:00 | A1 | Lecture 7b | BPMN key features |  | 
-| 13 | Tue | 27/10 | 09:00-11:00 | L1 | Lecture 9 | Petri nets: occurrence graph, boundedness, coverability graph | [[http://woped.dhbw-karlsruhe.de/|Woped]] | +| 13 | Tue | 27/10 | 09:00-11:00 | L1 | Lecture 8 | Petri nets: finite automata, nets, markings, firing | | 
-| 14 | Thu | 29/10 | 16:00-18:00 | A1 | Lecture 10 | Petri nets: Liveness, place liveness, deadlock freedom |  | +| 14 | Thu | 29/10 | 16:00-18:00 | A1 | Lecture 9 | Petri nets: occurrence graph, boundedness, coverability graph | [[http://woped.dhbw-karlsruhe.de/|Woped]] | 
-| 15 |  |  |  |  | Lecture 11 | Petri nets as matrices: incidence matrix, Parikh vectors, Marking equation lemma, Monotonicity lemma, Boundedness lemma, Repetition lemma |  | +| 15 |  |  |  |  | Lecture 10 | Petri nets: Liveness, place liveness, deadlock freedom |  | 
-| 16 |  |  |  |  | Lecture 12 | Workflow nets: Soundness, N*, Main theorem, Strong connectedness theorem | [[http://woped.dhbw-karlsruhe.de/|Woped]] | +| 16 |  |  |  |  | Lecture 11 | Petri nets as matrices: incidence matrix, Parikh vectors, Marking equation lemma, Monotonicity lemma, Boundedness lemma, Repetition lemma |  | 
-| 17 |  |  |  |  | Lecture 13\\ Lecture 14 | Sound and safe WfN by construction\\ Invariants: S-invariants|  | +| 17 |  |  |  |  | Lecture 12 | Workflow nets: Soundness, N*, Main theorem, Strong connectedness theorem | [[http://woped.dhbw-karlsruhe.de/|Woped]] | 
-| 18 |  |  |  |  | Lecture 14\\ Lecture 15 | Invariants: T-invariants\\ Structural properties: S-systems, T-systems |  | +| 18 |  |  |  |  | Lecture 13\\ Lecture 14 | Sound and safe WfN by construction\\ Invariants: S-invariants|  | 
-| 19 |  |  |  |  | Lecture 16a\\ Lecture 16b | From EPC to WfN\\ From BPMN to WfN |  | +| 19 |  |  |  |  | Lecture 14\\ Lecture 15 | Invariants: T-invariants\\ Structural properties: S-systems, T-systems |  | 
-| 20 |  |  |  |  | Lecture 17 aux\\ Lecture 17 | P vs NP: Decision problems and complexity classes\\ Structural properties: Free-choice nets |  | +| 20 |  |  |  |  | Lecture 16a\\ Lecture 16b | From EPC to WfN\\ From BPMN to WfN |  | 
-| 21 |  |  |  |  | Lecture 18\\ Lecture 19 | Worflow systems: workflow modules, relaxed soundness\\ Conformance measures |  | +| 21 |  |  |  |  | Lecture 17 aux\\ Lecture 17 | P vs NP: Decision problems and complexity classes\\ Structural properties: Free-choice nets |  | 
-| 22 |  |  |  |  | Lecture V4 | Conformance checking: how good is my model? How good is the log? //**(Prof. Vandin)**// |  |+| 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]] | | 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]] |
  
magistraleinformaticaeconomia/mpb/start.txt · Ultima modifica: da Roberto Bruni
Donate Powered by PHP Valid HTML5 Valid CSS Driven by DokuWiki