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 [04/11/2021 alle 14:29 (8 mesi fa)]
Roberto Bruni [Lectures (second half)]
magistraleinformaticaeconomia:mpb:start [25/11/2021 alle 08:28 (7 mesi fa)]
Roberto Bruni [Lectures (second half)]
Linea 211: Linea 211:
 ^ 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// |  | | 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// |  |
-| 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 analysisverification and validation,\\ reachability analysis, coverability graph// | [[http://woped.dhbw-karlsruhe.de/|Woped]] |+| 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// | [[http://woped.dhbw-karlsruhe.de/|Woped]] | 
 +| 17 | Wed 10/11 | 16:00-18:00 | C1 - Teams | Exercises (from Lecture 11)\\ Exercises (from Lecture 13)\\ Lecture 14 (2nd part) | Analysis of workflow nets:\\ //verification and validation, reachability analysis, coverability graph, soundness, N*, strong connectedness of N*, main soundness theorem// |  | 
 +| 18 | Thu 11/11 | 16:00-18:00 | M1 - Teams | Lecture 14 (3rd part)\\ {{ :magistraleinformaticaeconomia:mpb:15-wfnets-construction-2021.pdf |Lecture 15}}\\ {{ :magistraleinformaticaeconomia:mpb:16-s-systems-2021.pdf |Lecture 16}} | Analysis of workflow nets:\\ //proof of main soundness theorem//\\ \\ Safe Workflow nets:\\ //soundness (and safeness) by construction//\\ \\ S-systems:\\ //fundamental property of S-systems, S-invariants of S-nets, liveness theorem, reachability lemma, reachability theorem, boundedness theorem, workflow S-nets//  |  | 
 +| 19 | Wed 17/11 | 16:00-18:00 | C1 - Teams | Exercises (from Lecture 14)\\ Exercises (from Lecture 15)\\ Exercises (from Lecture 16)\\ {{ :magistraleinformaticaeconomia:mpb:17-t-systems-short-2021.pdf |Lecture 17}}\\ {{ :magistraleinformaticaeconomia:mpb:18bis-p-np-short-2021.pdf |A note on P and NP}} (optional reading) | 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) |  | 
 +| 20 | Thu 18/11 | 16:00-18:00 | M1 - Teams | {{ :magistraleinformaticaeconomia:mpb:18-free-choice-short-2021.pdf |Lecture 18}}\\ {{ :magistraleinformaticaeconomia:mpb:19-wfnets-diagnosis-short-2021.pdf |Lecture 19}} (1st part) | Free-choice nets:\\ //Fundamental property of free-choice nets, clusters, stable sets, siphons, proper siphons, fundamental property of siphons, siphons and liveness, Rank  theorem, 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// | [[http://woped.dhbw-karlsruhe.de/|Woped]] | 
 +| 21 | Wed 24/11 | 16:00-18:00 | C1 - Teams | Exercises (from Lecture 17)\\ Exercises (from Lecture 18)\\ Lecture 19 (2nd part)\\ {{ :magistraleinformaticaeconomia:mpb:20-workflow-systems-2021.pdf |Lecture 20}} | Diagnosis of Workflow nets:\\ //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]] | 
 +| 22 | Thu 25/11 | 16:00-18:00 | M1 - Teams | {{ :magistraleinformaticaeconomia:mpb:21-epc-new-2021.pdf |Lecture 21}} | 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]] |
 | - |  |  |  |  | Contents under restructuring |  | | - |  |  |  |  | Contents under restructuring |  |
-21 |  |  | 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// |  | +23 |  |  | Teams | Exercises (from Lecture 20)\\ Exercises (from Lecture 21)\\ Lecture 22\\ Exercises (from Lecture 22) | BPMN:\\ //Notationswimlanesflow objectsartefactsconnecting objectscollaborationschoreographies,  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]] | 
-22 |  |  | Teams | More Exercises (from Lecture 14)\\ Exercises (from Lecture 15)\\ Lecture 16 (2nd part)\\ Lecture 17\\ Lecture 18 (1st part) | S-systems:\\ //liveness theoremreachability lemma,\\ reachability theoremboundedness 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//  |  | +24 |  |  | Teams | Lecture 23\\ Exercises (from Lecture 23)\\ Lecture 24\\ A final note (with project instructions) | Quantitative analysis:\\ //Performance dimensions and objectivesKPIcyle time analysisLittle's lawcost analysis//\\ \\ Process mining:\\ //Event logs, discovery, conformance, enhancement, perspectives, play-in, play-out, replay, overfitting, underfitting, alpha-algorithm, footprint matrix, naive fitness, improved fitness, comparing footprints//  | [[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]] +
-| 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]] | +
-25 |  |  | Teams | Exercises (from Lecture 20)\\ Exercises (from Lecture 21)\\ Lecture 22\\ Exercises (from Lecture 22)\\ A final note (with project instructions) | BPMN:\\ //Notationswimlanesflow objects,\\ artefactsconnecting 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]] |+
 | end |  |  |  |  |  |  | | end |  |  |  |  |  |  |
  
magistraleinformaticaeconomia/mpb/start.txt · Ultima modifica: 05/03/2022 alle 09:04 (4 mesi fa) da Roberto Bruni