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
magistraleinformaticaeconomia:mpb:start [24/11/2021 alle 05:59 (2 mesi fa)]
Roberto Bruni [Lectures (second half)]
magistraleinformaticaeconomia:mpb:start [01/12/2021 alle 08:44 (8 settimane fa)] (versione attuale)
Roberto Bruni [Lectures (second half)]
Linea 217: Linea 217:
 | 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]] | | 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]] | | 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 | 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]] +| 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 |  +| 23 | Wed 01/12 16:00-18:00 C1 - Teams | Exercises (from Lecture 19)\\ Exercises (from Lecture 20)\\ Exercises (from Lecture 21)\\ {{ :magistraleinformaticaeconomia:mpb:22-bpmn-new-2021.pdf |Lecture 22}} | BPMN:\\ //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]] | 
-| 23 |   | Teams | Exercises (from Lecture 20)\\ Exercises (from Lecture 21)\\ Lecture 22\\ Exercises (from Lecture 22) | BPMN:\\ //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]] | +| 24 | Thu 02/12 16:00-18:00 M1 - Teams | Exercises (from Lecture 22)\\ {{ :magistraleinformaticaeconomia:mpb:23-quantitative-analysis-2021.pdf |Lecture 23}}\\ Exercises (from Lecture 23)\\ {{ :magistraleinformaticaeconomia:mpb:99-missed-2021.pdf |A final note}} (with project instructions) | Quantitative analysis:\\ //Performance dimensions and objectives, KPI, cyle time analysis, Little's law, cost analysis//  | [[http://www.processmining.org/prom/start|ProM]] |
-| 24 |   | Teams | Lecture 23\\ Exercises (from Lecture 23)\\ Lecture 24\\ A final note (with project instructions) | Quantitative analysis:\\ //Performance dimensions and objectives, KPI, cyle time analysis, Little's law, cost 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]] |+
 | end |  |  |  |  |  |  | | end |  |  |  |  |  |  |
  
magistraleinformaticaeconomia/mpb/start.1637733581.txt.gz · Ultima modifica: 24/11/2021 alle 05:59 (2 mesi fa) da Roberto Bruni