Entrambe le parti precedenti la revisioneRevisione precedenteProssima revisione | Revisione precedente |
magistraleinformaticaeconomia:mpb:start [18/11/2021 alle 16:58 (3 anni fa)] – [Lectures (second half)] Roberto Bruni | magistraleinformaticaeconomia:mpb:start [25/09/2024 alle 20:24 (31 ore fa)] (versione attuale) – [Announcements] Roberto Bruni |
---|
<html> | |
<!-- Google Analytics --> | |
<script type="text/javascript" charset="utf-8"> | |
(function(i,s,o,g,r,a,m){i['GoogleAnalyticsObject']=r;i[r]=i[r]||function(){ | |
(i[r].q=i[r].q||[]).push(arguments)},i[r].l=1*new Date();a=s.createElement(o), | |
m=s.getElementsByTagName(o)[0];a.async=1;a.src=g;m.parentNode.insertBefore(a,m) | |
})(window,document,'script','//www.google-analytics.com/analytics.js','ga'); | |
| |
ga('create', 'UA-34685760-1', 'auto', 'personalTracker', {'allowLinker': true}); | |
ga('personalTracker.require', 'linker'); | |
ga('personalTracker.linker:autoLink', ['pages.di.unipi.it', 'enforce.di.unipi.it', 'didawiki.di.unipi.it'] ); | |
| |
ga('personalTracker.require', 'displayfeatures'); | |
ga('personalTracker.send', 'pageview', 'ruggieri/teaching/bpm/'); | |
setTimeout("ga('send','event','adjusted bounce rate','30 seconds')",30000); | |
</script> | |
<!-- End Google Analytics --> | |
<!-- Global site tag (gtag.js) - Google Analytics --> | |
<script async src="https://www.googletagmanager.com/gtag/js?id=G-LPWY0VLB5W"></script> | |
<script> | |
window.dataLayer = window.dataLayer || []; | |
function gtag(){dataLayer.push(arguments);} | |
gtag('js', new Date()); | |
| |
gtag('config', 'G-LPWY0VLB5W'); | |
</script> | |
<!-- Capture clicks --> | |
<script> | |
jQuery(document).ready(function(){ | |
jQuery('a[href$=".pdf"]').click(function() { | |
var fname = this.href.split('/').pop(); | |
ga('personalTracker.send', 'event', 'BPM', 'PDFs', fname); | |
}); | |
jQuery('a[href$=".r"]').click(function() { | |
var fname = this.href.split('/').pop(); | |
ga('personalTracker.send', 'event', 'BPM', 'Rs', fname); | |
}); | |
jQuery('a[href$=".zip"]').click(function() { | |
var fname = this.href.split('/').pop(); | |
ga('personalTracker.send', 'event', 'BPM', 'ZIPs', fname); | |
}); | |
jQuery('a[href$=".mp4"]').click(function() { | |
var fname = this.href.split('/').pop(); | |
ga('personalTracker.send', 'event', 'BPM', 'Videos', fname); | |
}); | |
jQuery('a[href$=".flv"]').click(function() { | |
var fname = this.href.split('/').pop(); | |
ga('personalTracker.send', 'event', 'BPM', 'Videos', fname); | |
}); | |
}); | |
</script> | |
</html> | |
====== Business Processes Modeling ====== | ====== Business Processes Modeling ====== |
| |
{{:magistraleinformaticaeconomia:mpb:hand-drawing-diagram.png?180 | }} | {{:magistraleinformaticaeconomia:mpb:hand-drawing-diagram.png?180 | }} |
| |
**MPB 2021/22 (295AA / 372AA, 6 cfu)** | **MPB 2024/25 (295AA / 372AA, 6 cfu)** |
| |
Lecturer: **Roberto Bruni** | Lecturer: **Roberto Bruni** |
Contact: [[http://www.di.unipi.it/~bruni|web]] - [[mailto:bruni@di.unipi.it|email]] - phone 050 2212785 - fax 050 2212726 | Contact: [[http://www.di.unipi.it/~bruni|web]] - [[mailto:bruni@di.unipi.it|email]] - phone 050 2212785 - fax 050 2212726 |
| |
Office hours: **Wednesday 14:00-16:00 or by appointment** | Office hours: **Wednesday 16:00-18:00 or by appointment** |
| |
| |
| |
[[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}}]] | [[https://www.win.tue.nl/woflan/index.html|{{: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://promtools.org/|{{: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}}]] |
[[http://bpmn.io/|{{:magistraleinformaticaeconomia:mpb:bpmn.io.logo.png?50|}}]] | [[http://bpmn.io/|{{:magistraleinformaticaeconomia:mpb:bpmn.io.logo.png?50|}}]] |
[[https://camunda.com/products/camunda-bpm/modeler/|{{:magistraleinformaticaeconomia:mpb:modeler.png?60|}}]] | [[https://camunda.com/platform/modeler/|{{:magistraleinformaticaeconomia:mpb:modeler.png?60|}}]] |
[[https://www.bizagi.com/platform/modeler|{{:magistraleinformaticaeconomia:mpb:100x_modeler.png?60|}}]] | [[https://www.bizagi.com/platform/modeler|{{:magistraleinformaticaeconomia:mpb:100x_modeler.png?60|}}]] |
[[http://www.visual-paradigm.com/product/vpuml|{{:magistraleinformaticaeconomia:mpb:vpuml60logo.gif?150|http://www.visual-paradigm.com/product/vpuml}}]] | [[http://www.visual-paradigm.com/product/vpuml|{{:magistraleinformaticaeconomia:mpb:vpuml60logo.gif?150|http://www.visual-paradigm.com/product/vpuml}}]] |
| |
* [[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) | * [[https://www.win.tue.nl/woflan/index.html|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://promtools.org/|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 |
* [[http://bpmn.io/|BPMN.io]]: BPMN Editor | * [[http://bpmn.io/|BPMN.io]]: BPMN Editor |
* [[https://camunda.com/products/camunda-bpm/modeler/|Camunda Modeler]]: BPMN Editor | * [[https://camunda.com/platform/modeler/|Camunda Modeler]]: BPMN Editor |
* [[https://www.bizagi.com/platform/modeler|Bizagi Process Modeler]]: BPMN editor (Windows only) | * [[https://www.bizagi.com/platform/modeler|Bizagi Process Modeler]]: BPMN editor (Windows only) |
* [[https://www.visual-paradigm.com/|Visual Paradigm]] supports University of Pisa with [[https://www.visual-paradigm.com/features/uml-and-sysml-tools/|UML tools]] and [[https://www.visual-paradigm.com/features/database-design-with-erd-tools/|ERD tools]] under the [[https://www.visual-paradigm.com/partner/academic/|VP Academic Training Partner Program]] | * [[https://www.visual-paradigm.com/|Visual Paradigm]] supports University of Pisa with [[https://www.visual-paradigm.com/features/uml-and-sysml-tools/|UML tools]] and [[https://www.visual-paradigm.com/features/database-design-with-erd-tools/|ERD tools]] under the [[https://www.visual-paradigm.com/partner/academic/|VP Academic Training Partner Program]] |
* **How do we register for the exam?** //As usual, you must enter your choice on the [[https://esami.unipi.it/esami/|ESAMI]] portal.// | * **How do we register for the exam?** //As usual, you must enter your choice on the [[https://esami.unipi.it/esami/|ESAMI]] portal.// |
* **What are the dates of the exam?** //THE DATES ADVERTISED IN THE ESAMI PORTAL ARE NOT NECESSARILY THOSE OF THE ACTUAL EXAM. After you register for the exam, on the basis of the projects received and any other constraint communicated by each student, the teacher will post a tentative schedule on this web page and will inform you by email or on Teams.// | * **What are the dates of the exam?** //THE DATES ADVERTISED IN THE ESAMI PORTAL ARE NOT NECESSARILY THOSE OF THE ACTUAL EXAM. After you register for the exam, on the basis of the projects received and any other constraint communicated by each student, the teacher will post a tentative schedule on this web page and will inform you by email or on Teams.// |
* **How is the exam organized?** //The exam is oral and it is organised in two parts: the first part will focus on the project discussion, the second part will involve all topics covered by the course. Due to the current pandemic situation, all exams will take place remotely, via the Microsoft Teams platform.// | * **How is the exam organized?** //The exam is oral and it is organised in two parts: the first part will focus on the project discussion, the second part will involve all topics covered by the course.// |
* **How is the project discussion organized?** //ALL GROUP MEMBERS MUST BE PRESENT TO THE PROJECT DISCUSSION. All group members must demonstrate they have participated to all the activites of the project. A negative evaluation of the project may require to rework some parts, submit a revised report and schedule a new exam (possibly at the next exam session). A positive evaluation of the project allows each group member to access the second part of the exam.// | * **How is the project discussion organized?** //ALL GROUP MEMBERS MUST BE PRESENT TO THE PROJECT DISCUSSION. All group members must demonstrate they have participated to all the activites of the project. A negative evaluation of the project may require to rework some parts, submit a revised report and schedule a new exam (possibly at the next exam session). A positive evaluation of the project allows each group member to access the second part of the exam.// |
* **How is the second part of the exam organized?** //DIFFERENT GROUP MEMBERS CAN ASK TO SCHEDULE THE SECOND PART OF THE EXAM ON DIFFERENT DAYS. Questions may involve (but are not limited to): most relevant concepts, definitions, terminology and techniques; their intuitive meaning and formalization; proof sketches of formal statements; small-sized exercises. Arguments marked as optional in the lectures table below can be discussed upon student request.// | * **How is the second part of the exam organized?** //DIFFERENT GROUP MEMBERS CAN ASK TO SCHEDULE THE SECOND PART OF THE EXAM ON DIFFERENT DAYS. Questions may involve (but are not limited to): most relevant concepts, definitions, terminology and techniques; their intuitive meaning and formalization; proof sketches of formal statements; small-sized exercises. Arguments marked as optional in the lectures table below can be discussed upon student request.// |
==== 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. | * The **Lecture of Thursday September 26 is canceled** due to conflicting institutional activities of the teacher |
| * |
| * **as the course starts**:\\ Please spend a few minutes to fill the form [[https://forms.office.com/e/EMpfQwWYME|Background Check]] that will be helpful to tune the pace and content of the course. |
| |
---- | ---- |
==== 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%3A52ODJIa4PmQKbWWGTJ7uITYW99Ln39A8YrKklFs1qhk1%40thread.tacv2/conversations?groupId=1d208779-eb01-42a6-912a-cd9af57b62c6&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 | 19/09 | 16:00-18:00 | L1 | {{ :magistraleinformaticaeconomia:mpb:01-introduction-2024.pdf |Lecture 1}} | Course introduction:\\ //course objectives, textbooks, BPM aim and motivation, models and abstraction// | | |
| 2 | 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// | | | | 2 | 20/09 | 16:00-18:00 | L1 | {{ :magistraleinformaticaeconomia:mpb:02-business-processes-2024.pdf |Lecture 2}} | Introduction to Business Processes:\\ //Taylorism, work units, processes, terminology, organizational structures, process orientation and reengineering, visual notations// | | |
| 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// | | | | - | 26/09 | 16:00-18:00 | | **Lecture canceled due to conflicting institutional activities** | | | |
| 4 | Thu 23/09 | 16:00-18:00 | M1 - Teams | Exercises\\ Lecture 3 (2nd part) | Examples and Exercises\\ \\ Examples:\\ //Collaboration diagrams, choreography diagrams// | | | | 3 | 27/09 | 16:00-18:00 | L1 | Exercises\\ Lecture 3 (1st part) | Exercises:\\ //Alice-Bob car selling scenario//\\ \\ Examples:\\ //Orchestration diagrams, collaboration diagrams// | | |
| 5 | 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// | | | 4 | | 16:00-18:00 | L1 | Exercises\\ Lecture 3 (2nd part)\\ Lecture 4 (1st part) | Examples and Exercises:\\ //Travel agency ochestration, choreography diagrams//\\ \\ Business Process Guidelines:\\ //levels of business processes, business strategies, operational goals, organizational BP, operational BP, business process definition, design guidelines, functional decomposition// | | |
| 6 | 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// | | | | 5 | | 16:00-18:00 | L1 | Exercises\\ Lecture 4 (2nd part) | Exercises:\\ //Buyer-reseller collaboration, vending machine interactions//\\ \\ Business Process Guidelines:\\ //implemented BP, software architectures, separation of concerns, sw architectures, individual enterprise applications, enterprise resource planning system, siloed enterprise applications, enterprise application integration, point-to-point integration, hub-and-spoke integration, workflow definition, enterprise service computing// | | |
| 7 | 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// | | | | 6 | | 16:00-18:00 | L1 | Lecture 5\\ Lecture 6 (1st part) | Business Processes Lifecyle:\\ //design and analysis, models and instances, horizontal abstraction, aggregation abstraction, vertical abstraction, separation of concerns, validation, simulation, verification, configuration, testing, enactment, logging, evaluation, monitoring, mining, administration, stakeholders//\\ \\ EPC:\\ //Event-driven Process Chain, events, functions, connectors, EPC diagrams// | [[https://online.visual-paradigm.com/diagrams/features/epc-diagram-tool/|VP]]\\ [[http://www.yworks.com/en/products_yed_about.html|yEd]] | |
| 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]] | | | 7 | | 16:00-18:00 | L1 | Lecture 6 (2nd part)\\ Lecture 7 (1st part) | EPC:\\ //guidelines, diagram repair, function annotations, EPML, folder-passing semantics, candidate split, corresponding split, matching split, OR-join policies (wait-for-all, first-come, every-time), examples//\\ \\ BPMN:\\ //Notation, swimlanes// | [[https://online.visual-paradigm.com/diagrams/features/epc-diagram-tool/|VP]]\\ [[http://www.yworks.com/en/products_yed_about.html|yEd]] | |
| 9 | 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 | | | | 8 | | 16:00-18:00 | L1 | Lecture 7 (2nd part) | BPMN:\\ //flow objects, artefacts, connecting objects, collaborations, choreographies// | [[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]] | |
| 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// | | | | 9 | | 16:00-18:00 | L1 | Exercises (from Lectures 6 and 7)\\ Lecture 8 (1st part) | Exercises:\\ //EPC and BPMN modelling//\\ \\ From automata to nets:\\ //Inductive definitions, Kleene star, finite state automata, transition function, destination function, language accepted by an automaton// | | |
| 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// | | | | 10 | | 16:00-18:00 | L1 | Lecture 8 (2nd part)\\ Lecture 9 (1st part) | From automata to nets:\\ //from automata to Petri nets, places, transitions, tokens//\\ \\ Petri nets basics:\\ //multisets and markings, transition enabling and firing, firing sequences, reachable markings//\\ \\ Woped basics | [[http://woped.dhbw-karlsruhe.de/|Woped]] | |
| 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// | | | | 11 | | 16:00-18:00 | L1 | Exercises (from Lectures 8 and 9)\\ Lecture 9 (2nd part)\\ Lecture 10 (1st part) | Exercises:\\ //automata and Petri nets//\\ \\ Petri nets basics:\\ //occurrence graph, modelling with Petri nets, examples and exercises//\\ \\ Woped basics\\ \\ Behavioural properties:\\ //liveness, non live transitions, dead transitions// | | |
| 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)// | | | | 12 | | 16:00-18:00 | L1 | Exercises (from Lecture 10)\\ Lecture 10 (2nd part) | Exercises:\\ //modelling with Petri nets//\\ \\ Behavioural properties:\\ //place liveness, non live places, dead places, deadlock freedom, boundedness, safeness// | | |
| 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// | | | |
| |
| |
==== 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%3A52ODJIa4PmQKbWWGTJ7uITYW99Ln39A8YrKklFs1qhk1%40thread.tacv2/conversations?groupId=1d208779-eb01-42a6-912a-cd9af57b62c6&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 | | 16:00-18:00 | L1 | Exercises (from Lecture 10)\\ Lecture 10 (3rd part)\\ Lecture 11 (1st part) | Exercises:\\ //behavioural properties//\\ \\ Behavioural properties:\\ //home marking, cyclicity//\\ \\ Structural properties:\\ //weak and strong connectedness, S-systems, T-systems, free-choice nets//\\ \\ Nets as matrices:\\ //markings as vectors, incidence matrices// | | |
| 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]] | | | 14 | | 16:00-18:00 | L1 | Lecture 11 (2nd part)\\ Exercises (from Lectures 10 and 11)\\ Lecture 12 (1st part) | Nets as matrices:\\ //Parikh vectors, marking equation lemma, monotonicity lemma (1, 2 and corollary), boundedness lemma, repetition lemma//\\ \\ Exercises:\\ //structural properties, net as matrices//\\ \\ Invariants:\\ //S-invariants, fundamental property of S-invariants, alternative characterization of S-invariant// | | |
| 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// | | | | 15 | | 16:00-18:00 | L1 | Lecture 12 (2nd part)\\ Exercises (from Lecture 12)\\ Lecture 13 (1st part) | Invariants:\\ //support, positive S-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// | | |
| 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// | | | | 16 | | 16:00-18:00 | L1 | Lecture 13 (2nd part)\\ Lecture 14 (1st part) | Workflow nets:\\ //control flow aspects, 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]] | |
| 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) | | | | 17 | | 16:00-18:00 | L1 | Exercises (from Lectures 13 and 14)\\ Lecture 14 (2nd part)\\ Lecture 15\\ Lecture 16 | Exercises:\\ //workflow nets and soundeness//\\ \\ Analysis of workflow nets:\\ //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, liveness theorem, reachability lemma, reachability theorem, boundedness theorem, workflow S-nets// | [[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]] | | | 18 | | 16:00-18:00 | L1 | Exercises (from Lectures 15 and 16)\\ Lecture 17\\ A note on P and NP (optional reading)\\ Lecture 18 (1st part) | 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)\\ \\ 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//\\ \\ Exercises:\\ //soundness by construction, S-nets properties, T-nets properties// | | |
| - | | | | | Contents under restructuring | | | | 19 | | 16:00-18:00 | L1 | Exercises (from Lectures 14 and 18)\\ Lecture 18 (2nd part)\\ Lecture 20 (1st part) | Free-choice nets:\\ //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, semantics ambiguities, relaxed sound nets, relaxed sound EPC diagrams//\\ \\ Exercises:\\ //workflow net analysis with Woped, properties of free-choice nets, workflow systems// | [[http://woped.dhbw-karlsruhe.de/|Woped]] | |
| 21 | | | Teams | Exercises (from Lecture 17)\\ Exercises (from Lecture 18)\\ Lecture 19 (2nd part)\\ 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]] | | | 20 | | 16:00-18:00 | L1 | Lecture 20 (2nd part)\\ Lecture 19\\ Lecture 21 (1st part) | EPC:\\ //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//\\ \\ BPMN:\\ //from BPMN diagrams to nets// | [[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]] | |
| 22 | | | 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]] | | | 21 | | 16:00-18:00 | L1 | Exercises (from Lectures 18, 19, 20)\\ Lecture 21 (2nd part)\\ Lecture 22 (1st part) | Exercises:\\ //free-choice nets, workflow systems, EPC analysis//\\ \\ BPMN:\\ //from BPMN collaboration 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]] | |
| 23 | | | Teams | Exercises (from Lecture 20)\\ Exercises (from Lecture 21)\\ Lecture 22\\ Exercises (from Lecture 22)\\ A final note (with project instructions) | 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]] | | | 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]] | |
| | 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) | | |
| | 24 | | 16:00-18:00 | L1 | Questions and answers | | | |
| end | | | | | | | | | end | | | | | | | |
| |
==== Past courses ==== | ==== Past courses ==== |
| |
| * [[magistraleinformaticaeconomia:mpb:2023-24:|A.A. 2023/24]] |
| * [[magistraleinformaticaeconomia:mpb:2022-23:|A.A. 2022/23]] |
| * [[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]] |