Strumenti Utente

Strumenti Sito


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 revisione Revisione precedente
Prossima revisione
Revisione precedente
Prossima revisione Entrambe le parti successive la revisione
magistraleinformaticaeconomia:mpb:start [10/11/2021 alle 09:01 (2 anni fa)]
Roberto Bruni [Lectures (second half)]
magistraleinformaticaeconomia:mpb:start [30/01/2023 alle 13:48 (15 mesi fa)]
Roberto Bruni [Lectures (second half)]
Linea 12: Linea 12:
      
 ga('personalTracker.require', 'displayfeatures'); ga('personalTracker.require', 'displayfeatures');
-ga('personalTracker.send', 'pageview', 'ruggieri/teaching/bpm/');+ga('personalTracker.send', 'pageview', 'courses/bpm/');
 setTimeout("ga('send','event','adjusted bounce rate','30 seconds')",30000);  setTimeout("ga('send','event','adjusted bounce rate','30 seconds')",30000); 
 </script> </script>
Linea 55: Linea 55:
 {{:magistraleinformaticaeconomia:mpb:hand-drawing-diagram.png?180 | }} {{:magistraleinformaticaeconomia:mpb:hand-drawing-diagram.png?180 | }}
  
-**MPB 2021/22 (295AA / 372AA, 6 cfu)**+**MPB 2022/23 (295AA / 372AA, 6 cfu)**
  
 Lecturer: **Roberto Bruni** Lecturer: **Roberto Bruni**
Linea 108: Linea 108:
 [[http://woped.dhbw-karlsruhe.de/|{{:magistraleinformaticaeconomia:mpb:woped-icon.png?50|http://woped.dhbw-karlsruhe.de/woped/}}]]  [[http://woped.dhbw-karlsruhe.de/|{{:magistraleinformaticaeconomia:mpb:woped-icon.png?50|http://woped.dhbw-karlsruhe.de/woped/}}]] 
 [[http://www.win.tue.nl/woflan/doku.php|{{:magistraleinformaticaeconomia:mpb:e8adaea8122411aaa79b8afec7c9fb32.media.272x236.jpg?80|http://www.win.tue.nl/woflan/doku.php}}]]  [[http://www.win.tue.nl/woflan/doku.php|{{:magistraleinformaticaeconomia:mpb:e8adaea8122411aaa79b8afec7c9fb32.media.272x236.jpg?80|http://www.win.tue.nl/woflan/doku.php}}]] 
-[[http://www.processmining.org/prom/start|{{:magistraleinformaticaeconomia:mpb:tools.png?60}}]] +[[https://www.promtools.org/doku.php|{{:magistraleinformaticaeconomia:mpb:tools.png?60}}]] 
 [[http://www.yworks.com/en/products_yed_about.html|{{:magistraleinformaticaeconomia:mpb:logo.gif?80}}]] [[http://www.yworks.com/en/products_yed_about.html|{{:magistraleinformaticaeconomia:mpb:logo.gif?80}}]]
 [[http://bpmn.sourceforge.net/|{{:magistraleinformaticaeconomia:mpb:188072_149141125103453_6888195_q.jpg}}]] [[http://bpmn.sourceforge.net/|{{:magistraleinformaticaeconomia:mpb:188072_149141125103453_6888195_q.jpg}}]]
Linea 118: Linea 118:
   * [[http://woped.dhbw-karlsruhe.de/|Woped]]: Workflow Petri Net Designer   * [[http://woped.dhbw-karlsruhe.de/|Woped]]: Workflow Petri Net Designer
   * [[http://www.win.tue.nl/woflan/doku.php|Woflan]]: a Petri-net-based Workflow Analyzer (Windows only), also available as a [[http://www.processmining.org/prom/start|ProM]] plugin (all platforms)   * [[http://www.win.tue.nl/woflan/doku.php|Woflan]]: a Petri-net-based Workflow Analyzer (Windows only), also available as a [[http://www.processmining.org/prom/start|ProM]] plugin (all platforms)
-  * [[http://www.processmining.org/prom/start|ProM]]: Process Mining Framework+  * [[https://www.promtools.org/doku.php|ProM]]: Process Mining Framework
   * [[http://www.yworks.com/en/products_yed_about.html|yEd]]: Graph Editor   * [[http://www.yworks.com/en/products_yed_about.html|yEd]]: Graph Editor
   * [[http://bpmn.sourceforge.net/|Yaoqiang BPMN Editor]]: BPMN Editor   * [[http://bpmn.sourceforge.net/|Yaoqiang BPMN Editor]]: BPMN Editor
Linea 178: Linea 178:
 ==== Announcements ==== ==== Announcements ====
  
-   * **as the course starts**:\\ Please spend a few minutes to fill the form [[https://forms.office.com/Pages/ResponsePage.aspx?id=MWtFxyCi9Ue-Ukc4KGcKoaIp00F3tFROvaR9GeCNcHhUQlRWVDk4WVQxTFcwMFpJSUNZVjNRRUpBSCQlQCN0PWcu|Background Check]] that will be helpful to tune the pace and content of the course.+   * **as the course starts**:\\ Please spend a few minutes to fill the form [[https://forms.office.com/Pages/ResponsePage.aspx?id=MWtFxyCi9Ue-Ukc4KGcKocDq9qB_sSdNvz5-wvGxj7hUQVZIRUROVjQ4TTEwUExVOU9ESFo4VElNTSQlQCN0PWcu|Background Check]] that will be helpful to tune the pace and content of the course.
  
 ---- ----
Linea 185: Linea 185:
 ==== Lectures (first half) ==== ==== Lectures (first half) ====
  
-[[https://teams.microsoft.com/l/team/19%3ad57NtDs_DLS6tp-qMKF90Gp1hy23GMwD1-ZqQ2k9D981%40thread.tacv2/conversations?groupId=41d329a2-b477-4e54-bda4-7d19e08d7078&tenantId=c7456b31-a220-47f5-be52-473828670aa1|Virtual classroom]]: To join a lecture enter the virtual classroom, go to the Calendar tab and click on the scheduled lecture.+[[https://teams.microsoft.com/l/team/19%3acZWU62MCCgN-y9QD1uXcldr0-VbqsMhS3C2qUOZ4Uo01%40thread.tacv2/conversations?groupId=a0f6eac0-b17f-4d27-bf3e-7ec2f1b18fb8&tenantId=c7456b31-a220-47f5-be52-473828670aa1|Microsoft Teams]]: Additional material is available on Teams.
  
 ^ N ^ Date ^ Time ^ Room ^ Lecture notes ^ Topics ^ Links ^ ^ N ^ Date ^ Time ^ Room ^ Lecture notes ^ Topics ^ Links ^
-| 1 | Wed 15/09 | 16:00-18:00 | C1 - Teams | {{ :magistraleinformaticaeconomia:mpb:01-introduction-2021.pdf |Lecture 1}} | Course introduction:\\ //course objectives, textbooks, BPM aim and motivation, models and abstraction// |  | +| 1 | Thu 15/09 | 16:00-18:00 | M1 | {{ :magistraleinformaticaeconomia:mpb:01-introduction-2022.pdf |Lecture 1}} | Course introduction:\\ //course objectives, textbooks, BPM aim and motivation, models and abstraction// |  | 
-Thu 16/09 | 16:00-18:00 | M1 - Teams | {{ :magistraleinformaticaeconomia:mpb:02-business-processes-2021.pdf |Lecture 2}} | Introduction to Business Processes:\\ //Taylorism, work units, processes, terminology, organizational structures, process orientation and reengineering, visual notations// |  | +- | Wed 21/09 | 16:00-18:00 | M1 | **Canceled** |  |  | 
-| 3 | Wed 22/09 | 16:00-18:00 | C1 - Teams | Exercises\\ {{ :magistraleinformaticaeconomia:mpb:03-examples-2021.pdf |Lecture 3}} (1st part) | Exercises:\\ //Alice-Bob car selling scenario//\\ \\ Examples:\\ //Orchestration diagrams// |  | +| - | Thu 22/09 | 16:00-18:00 | M1 | **Canceled** |  |  | 
-Thu 23/09 | 16:00-18:00 | M1 - Teams Exercises\\ Lecture 3 (2nd part) Examples and Exercises\\ \\ Examples:\\ //Collaboration diagrams, choreography diagrams// |  | +| 2 | Wed 28/09 | 16:00-18:00 | C1 | {{ :magistraleinformaticaeconomia:mpb:02-business-processes-2022.pdf |Lecture 2}} | Introduction to Business Processes:\\ //Taylorism, work units, processes, terminology, organizational structures, process orientation and reengineering, visual notations// |  | 
-Wed 29/09 | 16:00-18:00 | C1 - Teams | {{ :magistraleinformaticaeconomia:mpb:04-models-2021.pdf |Lecture 4}} | Business Process Modelling Abstractions:\\ //Separation of concerns, horizontal abstraction, aggregation abstraction, vertical abstraction// +| 3 | Wed 29/09 | 16:00-18:00 | M1 | Exercises\\ {{ :magistraleinformaticaeconomia:mpb:03-examples-2022.pdf |Lecture 3}} (1st part) | Exercises:\\ //Alice-Bob car selling scenario//\\ \\ Examples:\\ //Orchestration diagrams, collaboration diagrams, choreography diagrams// |  | 
-Thu 30/09 | 16:00-18:00 | M1 - Teams | {{ :magistraleinformaticaeconomia:mpb:05-lifecycle-2021.pdf |Lecture 5}}\\ {{ :magistraleinformaticaeconomia:mpb:06-methodology-2021.pdf |Lecture 6}} | Business Processes Lifecyle:\\ //design and analysis, configuration, enactment, evaluation, administration and stakeholders//\\ \\ Business Process Methodology:\\ //levels of business processes, business strategies, operational goals, organizational BP, operational BP, implemented BP, design guidelines, from business functions to processes, separation of concerns, sw architectures, individual enterprise applications, enterprise resource planning system, siloed enterprise applications, enterprise application integration, message-oriented middleware, enterprise service computing// |  | +Wed 05/10 | 16:00-18:00 | M1 | **Canceled**  |  | 
-Wed 06/10 | 16:00-18:00 | C1 - Teams | {{ :magistraleinformaticaeconomia:mpb:07-nets-intro-2021.pdf |Lecture 7}} | From automata to nets:\\ //Inductive definitions, Kleene star, finite state automata, transition function, destination function, language accepted by an automaton, from automata to Petri nets, places, transitions, tokens// |  | +Thu 06/10 | 16:00-18:00 | M1 Exercises\\ {{ :magistraleinformaticaeconomia:mpb:04-models-2022.pdf |Lecture 4}} | Examples and Exercises\\ \\ Business Process Modelling Abstractions:\\ //Separation of concerns, horizontal abstraction, aggregation abstraction, vertical abstraction//  | 
-| 8 | Thu 07/10 | 16:00-18:00 | M1 - Teams | Exercises (from Lecture 7)\\ {{ :magistraleinformaticaeconomia:mpb:08-petri-2021.pdf |Lecture 8}} (1st part) | Petri nets basics:\\ //multisets and markings, transition enabling and firing, firing sequences//\\ \\ Woped basics [[http://woped.dhbw-karlsruhe.de/|Woped]] +Wed 12/10 | 16:00-18:00 | M1 | {{ :magistraleinformaticaeconomia:mpb:05-lifecycle-2022.pdf |Lecture 5}}\\ {{ :magistraleinformaticaeconomia:mpb:06-methodology-2022.pdf |Lecture 6}} | Business Processes Lifecyle:\\ //design and analysis, configuration, enactment, evaluation, administration and stakeholders//\\ \\ Business Process Methodology:\\ //levels of business processes, business strategies, operational goals, organizational BP, operational BP, implemented BP, design guidelines, from business functions to processes, separation of concerns, sw architectures, individual enterprise applications, enterprise resource planning system, siloed enterprise applications, enterprise application integration, message-oriented middleware, enterprise service computing// |  | 
-Wed 13/10 | 16:00-18:00 | C1 - Teams | Lecture 8 (2nd part) | Petri nets basics:\\ //reachable markings, occurrence graph, modelling with Petri nets, examples and exercises//\\ \\ Woped basics |  +Thu 13/10 | 16:00-18:00 | M1 | {{ :magistraleinformaticaeconomia:mpb:07-nets-intro-2022.pdf |Lecture 7}}\\ {{ :magistraleinformaticaeconomia:mpb:08-petri-2022.pdf |Lecture 8}} (1st part) | From automata to nets:\\ //Inductive definitions, Kleene star, finite state automata, transition function, destination function, language accepted by an automaton, from automata to Petri nets, places, transitions, tokens//\\ \\ Petri nets basics:\\ //multisets and markings, transition enabling and firing// |  
-10 Thu 14/10 | 16:00-18:00 | M1 - Teams | Exercises (from Lecture 8)\\ {{ :magistraleinformaticaeconomia:mpb:09-properties-2021.pdf |Lecture 9}} (1st part) | Petri nets basics:\\ //Examples and Exercises//\\ \\ Behavioural properties:\\ //liveness, dead transitions, place liveness, dead places, deadlock freedom// |  | +Mon 17/10 | 16:00-18:00 | M1 Exercises (from Lecture 7)\\ Lecture 8 (2nd part) | Petri nets basics:\\ //firing sequences, reachable markings, occurrence graph, modelling with Petri nets, examples//\\ \\ Woped basics | [[http://woped.dhbw-karlsruhe.de/|Woped]] 
-11 Wed 20/10 | 16:00-18:00 | C1 - Teams Exercises (from Lecture 8)\\ Exercises (from Lecture 9)\\ Lecture 9 (2nd part)  | Behavioural properties:\\ //boundedness, safeness,  cyclicity//\\ \\ Structural properties:\\ //weak and strong connectedness, S-systems, T-systems, free-choice nets// |  | +Wed 19/10 | 16:00-18:00 | M1 | Exercises (from Lecture 8)\\ \\ {{ :magistraleinformaticaeconomia:mpb:09-properties-2022.pdf |Lecture 9}} (1st part) | Petri nets basics:\\ //modelling with Petri nets, examples and exercises//\\ \\ Woped basics\\ \\ Behavioural properties:\\ //liveness, non live transitions, dead transitions// |  | 
-12 Thu 21/10 | 16:00-18:00 | M1 - Teams | {{ :magistraleinformaticaeconomia:mpb:10-net-matrices-2021.pdf |Lecture 10}} (1st part) | Nets as matrices:\\ //markings as vectors, incidence matrices, Parikh vectors, marking equation lemma// |  | +Thu 20/10 | 16:00-18:00 | M1 | Lecture 9 (2nd part) | Behavioural properties:\\ //place liveness, non live places, dead places, deadlock freedom, boundedness, safeness,  cyclicity//\\ \\ Structural properties:\\ //weak and strong connectedness, S-systems, T-systems, free-choice nets// |  | 
-| 13 | Wed 27/10 | 16:00-18:00 | C1 - Teams | Exercises (from Lecture 9)\\ Lecture 10 (2nd part) | Nets as matrices:\\ //recap of marking equation lemma, monotonicity lemma (1, 2 and corollary)// |  | +10 Wed 26/10 | 16:00-18:00 | M1 | Exercises (from Lecture 9)\\ {{ :magistraleinformaticaeconomia:mpb:10-net-matrices-2022.pdf |Lecture 10}} (1st part) | Nets as matrices:\\ //markings as vectors, incidence matrices, Parikh vectors, marking equation lemma, monotonicity lemma (1, 2 and corollary)// |  | 
-14 | Thu 28/10 | 16:00-18:00 | M1 - Teams Exercises (from Lecture 10)\\ Lecture 10 (3rd part)\\ {{ :magistraleinformaticaeconomia:mpb:11-invariants-2021.pdf |Lecture 11}} (1st part) | Nets as matrices:\\ //boundedness lemma, repetition lemma//\\ \\ Invariants:\\ //S-invariants, fundamental property of S-invariants, alternative characterization of S-invariant, support, positive S-invariants, about boundedness, reachability and liveness// |  |+11 | Thu 27/10 | 16:00-18:00 | M1 | Lecture 10 (2nd part)\\ Exercises (from Lecture 10)\\ {{ :magistraleinformaticaeconomia:mpb:11-invariants-2022.pdf |Lecture 11}} (1st part) | Nets as matrices:\\ //boundedness lemma, repetition lemma//\\ \\ Invariants:\\ //S-invariants, fundamental property of S-invariants, alternative characterization of S-invariant, support, positive S-invariants, about boundedness and liveness// |  | 
 +| 12 | Wed 02/11 | 16:00-18:00 | M1 | Lecture 11 (2nd part)\\ {{ :magistraleinformaticaeconomia:mpb:13-workflow-nets-2022.pdf |Lecture 13}} (1st part) | Invariants:\\ //S-invariants and reachability, T-invariants, fundamental property of T-invariants, alternative characterization of T-invariants, reproduction lemma, about liveness and boundedness//\\ \\ Workflow nets:\\ //definition, syntax sugar, subprocesses, control flow aspects// |  | 
  
  
Linea 207: Linea 209:
 ==== Lectures (second half) ==== ==== Lectures (second half) ====
  
-[[https://teams.microsoft.com/l/team/19%3ad57NtDs_DLS6tp-qMKF90Gp1hy23GMwD1-ZqQ2k9D981%40thread.tacv2/conversations?groupId=41d329a2-b477-4e54-bda4-7d19e08d7078&tenantId=c7456b31-a220-47f5-be52-473828670aa1|Virtual classroom]]: To join a lecture enter the virtual classroom, go to the Calendar tab and click on the scheduled lecture.+[[https://teams.microsoft.com/l/team/19%3acZWU62MCCgN-y9QD1uXcldr0-VbqsMhS3C2qUOZ4Uo01%40thread.tacv2/conversations?groupId=a0f6eac0-b17f-4d27-bf3e-7ec2f1b18fb8&tenantId=c7456b31-a220-47f5-be52-473828670aa1|Microsoft Teams]]: Additional material is available on Teams.
  
 ^ N ^ Date ^ Time ^ Room ^ Lecture notes ^ Topics ^ Links ^ ^ N ^ Date ^ Time ^ Room ^ Lecture notes ^ Topics ^ Links ^
-15 Wed 03/11 | 16:00-18:00 | C1 - Teams | Lecture 11 (2nd part)\\ Exercises (from Lecture 11| Invariants:\\ //S-invariants and reachability, T-invariants, fundamental property of T-invariants, alternative characterization of T-invariants, reproduction lemma, about liveness and boundedness// |  | +13 Thu 03/11 | 16:00-18:00 | M1 Exercises (from Lecture 11)\\ Exercises (from Lecture 13)\\ Lecture 13 (2nd part)\\ {{ :magistraleinformaticaeconomia:mpb:14-wfnets-analysis-2022.pdf |Lecture 14}} (1st part)  | Workflow nets:\\ //triggers//\\ \\ Analysis of workflow nets:\\ //structural analysis, activity analysis, token analysis, net analysis, verification and validation, reachability analysis, coverability graph, soundness, N*// |  
-| 16 | Thu 04/11 | 16:00-18:00 | M1 - Teams | {{ :magistraleinformaticaeconomia:mpb:12-facts-2021.pdf |Lecture 12}}\\ {{ :magistraleinformaticaeconomia:mpb:13-workflow-nets-2021.pdf |Lecture 13}}\\ {{ :magistraleinformaticaeconomia:mpb:14-wfnets-analysis-2021.pdf |Lecture 14}} (1st part) | On strong connectedness:\\ //connectedness theorems//\\ \\ Workflow nets:\\ //definition, syntax sugar, subprocesses, control flow aspects, triggers//\\ \\ Analysis of workflow nets:\\ //structural analysis, activity analysis, token analysis, net analysis, verification and validation, reachability analysis, coverability graph// | [[http://woped.dhbw-karlsruhe.de/|Woped]] +14 Mon 07/11 | 16:00-18:00 | M1 | {{ :magistraleinformaticaeconomia:mpb:12-facts-2022.pdf |Lecture 12}}\\ Lecture 14 (2nd part)\\ {{ :magistraleinformaticaeconomia:mpb:15-wfnets-construction-2022.pdf |Lecture 15}}\\ Exercises (from Lecture 15 | On strong connectedness:\\ //connectedness theorems//\\ \\ Analysis of workflow nets:\\ //strong connectedness of N*, main soundness theorem//\\ \\ Safe Workflow nets:\\ //soundness (and safeness) by construction// | [[http://woped.dhbw-karlsruhe.de/|Woped]] 
-21 Wed 10/11 | 16:00-18:00 | C1 Teams Exercises (from Lecture 13)\\ Lecture 14 (2nd part)\\ Exercises (from Lecture 14)\\ Lecture 15\\ Lecture 16 (1st part) | Analysis of workflow nets:\\ //soundness, N*, strong connectedness of N*,\\ main soundness theorem//\\ \\ Safe Workflow nets:\\ //soundness (and safeness) by construction//\\ \\ S-systems:\\ //fundamental property of S-systems,\\ S-invariants of S-nets// |  +15 Wed 09/11 | 16:00-18:00 | M1 | Exercises (form Lecture 14)\\ {{ :magistraleinformaticaeconomia:mpb:16-s-systems-2022.pdf |Lecture 16}}\\ Exercises (from Lecture 16)\\ {{ :magistraleinformaticaeconomia:mpb:17-t-systems-short-2022.pdf |Lecture 17}}\\ Exercises (from Lecture 17) | 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// | [[http://woped.dhbw-karlsruhe.de/|Woped]] | 
-22 Thu 11/11 | 16:00-18:00 | M1 - Teams More Exercises (from Lecture 14)\\ Exercises (from Lecture 15)\\ Lecture 16 (2nd part)\\ Lecture 17\\ Lecture 18 (1st part) | S-systems:\\ //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//\\ \\ Free-choice nets:\\ //Fundamental property of free-choice nets\\ clusters, stable sets, siphons, proper siphons,\\ fundamental property of siphons,\\ siphons and liveness, Rank  theorem//  |  | +| 16 | Thu 10/11 | 16:00-18:00 | M1 | {{ :magistraleinformaticaeconomia:mpb:18-free-choice-short-2022.pdf |Lecture 18}}\\ {{ :magistraleinformaticaeconomia:mpb:18c-p-np-short-2022.pdf |A note on P and NP}} (optional reading) | Free-choice nets:\\ //Fundamental property of free-choice netsclusters, stable sets, siphons, proper siphons, fundamental property of siphons, siphons and liveness, Rank  theoremtraps, place-liveness = liveness in f.c. nets, Commoner's theorem and its complexity issues, Rank theorem and its complexity issues, sound f.c wf nets are safe//\\ \\ Decision problems and computational complexity (optional reading) |  | 
-| - |  |  |  |  | Contents under restructuring |  | +| 17 | Wed 16/11 | 16:00-18:00 | M1 | Exercises (from Lecture 18)\\ {{ :magistraleinformaticaeconomia:mpb:19-wfnets-diagnosis-short-2022.pdf |Lecture 19}}\\ {{ :magistraleinformaticaeconomia:mpb:20-workflow-systems-2022.pdf |Lecture 20}} | Diagnosis of Workflow nets:\\ //Woped, S-components, S-cover, TP-handles, PT-handles, well-handled nets, well-structured wf nets, Woflan, ProM, error sequences, non-live sequences, unbounded sequences//\\ \\ Workflow systems:\\ //I/O interfaces, workflow modules, stuctural compatibility, workflow system, weak soundness// | [[http://woped.dhbw-karlsruhe.de/|Woped]]\\ [[http://www.win.tue.nl/woflan/|Woflan]]\\ [[http://www.processmining.org/prom/start|ProM]] | 
-| 23 |  |  | Teams | Exercises (from Lecture 16)\\ Exercises (from Lecture 17)\\ Exercises (from Lecture 18)\\ A note on P and NP (optional reading)\\ Lecture 18 (2nd part)\\ Lecture 19 | Decision problems and computational complexity (optional reading)\\ \\ Free-choice nets:\\ //traps (optional reading),\\ place-liveness = liveness in f.c. nets (optional reading),\\ Commoner's theorem and its complexity issues,\\ Rank theorem and its complexity issues,\\ sound f.c wf nets are safe//\\ \\ Diagnosis of Workflow nets:\\ //Woped, S-components, S-cover,\\ T-cover (optional reading),\\ TP-handles, PT-handles,\\ well-handled nets, well-structured wf nets,\\ Woflan, ProM, error sequences,\\ non-live sequences, unbounded sequences//  | [[http://woped.dhbw-karlsruhe.de/|Woped]]\\ [[http://www.win.tue.nl/woflan/|Woflan]]\\ [[http://www.processmining.org/prom/start|ProM]] | +18 Thu 17/11 16:00-18:00 M1 | Exercises (from Lecture 19)\\ Exercises (from Lecture 20)\\ {{ :magistraleinformaticaeconomia:mpb:21-epc-new-2022.pdf |Lecture 21}} (1st part) | EPC:\\ //Events, functions, connectors, EPC diagrams, guidelines, soundness analysis, from EPC to wf nets, net fragments, dummy style, fusion style, unique start, unique end, three transformations, semantics ambiguities, relaxed sound nets, relaxed sound EPC diagrams, from restricted EPC diagrams to f.c. nets//  | [[http://woped.dhbw-karlsruhe.de/|Woped]]\\ [[http://www.win.tue.nl/woflan/|Woflan]]\\ [[http://www.processmining.org/prom/start|ProM]]\\ [[https://online.visual-paradigm.com/diagrams/features/epc-diagram-tool/|VP]]\\ [[http://www.yworks.com/en/products_yed_about.html|yEd]] | 
-24   Teams | Exercises (from Lecture 19)\\ Lecture 20\\ Lecture 21 | Workflow systems:\\ //I/O interfaces, workflow modules,\\ stuctural compatibility, workflow system,\\ weak soundness//\\ \\ EPC:\\ //Events, functions, connectors,\\ EPC diagrams, guidelines,\\ soundness analysis, from EPC to wf nets,\\ net fragments, dummy style, fusion style,\\ unique start, unique end,\\ three transformations, semantics ambiguities,\\ relaxed sound nets (optional),\\ relaxed sound EPC diagrams (optional),\\ from restricted EPC diagrams to f.c. nets,\\ problems with (X)OR joins, candidate split,\\ corresponding split, matching split,\\ OR join policies (wfa, fc, et),\\ from decorated EPC diagrams to nets//  | [[https://online.visual-paradigm.com/diagrams/features/epc-diagram-tool/|VP]]\\ [[http://www.yworks.com/en/products_yed_about.html|yEd]] | +19 Wed 23/11 16:00-18:00 M1 | Lecture 21 (2nd part)\\ Exercises (from Lecture 21)\\ {{ :magistraleinformaticaeconomia:mpb:22-bpmn-new-2022.pdf |Lecture 22}} (1st part| EPC:\\ //problems with (X)OR joins, candidate split, corresponding split, matching split, OR join policies (wfa, fc, et), from decorated EPC diagrams to nets//\\ \\ BPMN:\\ //Notation, swimlanes, flow objects, artefacts, connecting objects, collaborations//  | [[http://bpmn.sourceforge.net/|Yaoqiang]]\\ [[http://bpmn.io/|BPMN.io]]\\ [[http://www.intalio.com/products/bpms/overview/|BPMS]]\\ [[http://www.bizagi.com/index.php/en/products/bizagi-process-modeler|Bizagi]]\\ [[https://online.visual-paradigm.com/diagrams|VP]]\\ [[http://www.processmining.org/prom/start|ProM]] 
-25   Teams Exercises (from Lecture 20)\\ Exercises (from Lecture 21)\\ Lecture 22\\ Exercises (from Lecture 22)\\ A final note (with project instructionsBPMN:\\ //Notation, swimlanes, flow objects,\\ artefacts, connecting objects,\\ collaborations, choreographies,\\  from BPMN to nets//  | [[http://bpmn.sourceforge.net/|Yaoqiang]]\\ [[http://bpmn.io/|BPMN.io]]\\ [[http://www.intalio.com/products/bpms/overview/|BPMS]]\\ [[http://www.bizagi.com/index.php/en/products/bizagi-process-modeler|Bizagi]]\\ [[https://online.visual-paradigm.com/diagrams|VP]]\\ [[http://www.processmining.org/prom/start|ProM]] |+| - | Thu 24/11 | 16:00-18:00 | M1 | **Canceled** |  |  | 
 +| 20 | Mon 28/11 | 16:00-18:00 | M1 | Lecture 22 (2nd part)\\ {{ :magistraleinformaticaeconomia:mpb:23-quantitative-analysis-2022.pdf |Lecture 23}} | BPMN:\\ //collaborations, choreographies,  from BPMN to nets//\\ \\ Quantitative analysis:\\ //Performance dimensions and objectives, KPI, cyle time analysis, Little's law, cost analysis// |  | 
 +| 21 | Wed 30/11 | 16:00-18:00 | M1 | Exercises (from Lecture 22)\\ Exercises (from Lecture 23)\\ {{ :magistraleinformaticaeconomia:mpb:24-mining-new-2022.pdf |Lecture 24}} | 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//\\ \\ A final note (with project instructions) |  |
 | end |  |  |  |  |  |  | | end |  |  |  |  |  |  |
  
Linea 229: Linea 233:
 ==== Past courses ==== ==== Past courses ====
  
 +  * [[magistraleinformaticaeconomia:mpb:2021-22:|A.A. 2021/22]]
   * [[magistraleinformaticaeconomia:mpb:2020-21:|A.A. 2020/21]]   * [[magistraleinformaticaeconomia:mpb:2020-21:|A.A. 2020/21]]
   * [[magistraleinformaticaeconomia:mpb:2019-20:|A.A. 2019/20]]   * [[magistraleinformaticaeconomia:mpb:2019-20:|A.A. 2019/20]]
magistraleinformaticaeconomia/mpb/start.txt · Ultima modifica: 14/02/2024 alle 15:40 (2 mesi fa) da Roberto Bruni