Indice

Business Processes Modeling

MPB 2025/26 (295AA / 372AA, 6 cfu)

Lecturers: Roberto Bruni, Andrea Vandin

Contact: web Bruni - web Vandin

Office hours: Thursday 15:00-18:00


Objectives

The course aims to reconcile abstraction techniques and high-level diagrammatic notations together with modular and structural approaches. The objective is to show the impact of the analysis and verification properties of business processes on the choice of the best suited specification and modelling languages. At the end of the course, the students will gain some familiarity with business process terminology, with different models and languages for the representation of business processes, with different kinds of logical properties that such models can satisfy and with different analysis and verification techniques. The students will also experiment with some tools for the design, synthesis and analysis of business processes.


Course Overview

Business process management. Evolution of Enterprise Systems Architectures. Conceptual models and abstraction mechanisms. Petri nets: invariants, S-systems, T-systems, Free-choice systems and their properties. Workflow nets and workflow modules. Workflow patterns. Event-driven Process Chains (EPC). Business Process Modelling Notation (BPMN), Process performance analysis. Process simulation. Process Mining.


Textbook(s)


Quick reference(s)


Tool(s)

http://woped.dhbw-karlsruhe.de/woped/ http://www.win.tue.nl/woflan/doku.php 188072_149141125103453_6888195_q.jpg http://www.visual-paradigm.com/product/vpuml


Exam

The evaluation will be based on a group project and an oral exam.

Registration to the exam is mandatory.

The student must demonstrate the ability to put into practice and to execute, with critical awareness, the activities illustrated or carried out under the guidance of the teacher during the course.

Project FAQ

Exam FAQ


Announcements


Lectures

Microsoft Teams: Additional material is available on Teams.

N Date Time Room Lecture notes Topics Links
1 17/09 14:00-16:00 L1 Lecture 1 Course introduction:
course objectives, textbooks, BPM aim and motivation, models and abstraction
2 19/09 11:00-13:00 L1 Lecture 2 Introduction to Business Processes:
Taylorism, work units, processes, terminology, organizational structures, process orientation and reengineering, visual notations
3 24/09 14:00-16:00 L1 Lecture 3 Exercises:
Alice-Bob car selling scenario

Examples:
Orchestration diagrams, collaboration diagrams, choreography diagrams
4 26/09 11:00-13:00 L1 Lecture V1 Introduction to Process Mining with hands-on tutorial on Fluxicon Disco (Prof. Vandin) Disco
5 01/10 14:00-16: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
Woped
- 03/10 11:00-13:00 L1 Canceled General strike
6 08/10 14:00-16:00 L1 Lecture 5 Process mining:
event logs, discovery, conformance, enhancement, perspectives, play-in, play-out, replay, overfitting, underfitting, footprint matrix, alpha-algorithm
- 10/10 11:00-13:00 L1 Canceled Orientation activities
7 15/10 14:00-16:00 Teams 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 17/10 11:00-13:00 C1 Lecture V3 Formal introduction to dependency graphs and to the heuristic miner. Footprint-based conformance checking. (Prof. Vandin)
9 22/10 14:00-16:00 C1 Lecture 6 Orchestration, choreography, collaboration diagrams VP
ARIS Express
yEd
Yaoqiang
BPMN.io
Camunda
Bizagi
10 24/10 11:00-13:00 C1 Lecture 7a EPC and BPMN guidelines
11 29/10 14:00-16:00 C1 Lecture 7b BPMN key features
12 31/10 11:00-13:00 C1 Lecture 8 Petri nets: finite automata, nets, markings, firing
13 05/11 14:00-16:00 C1 Lecture 9 Petri nets: occurrence graph, boundedness, coverability graph Woped
14 07/11 11:00-13:00 C1 Lecture 10 Petri nets: Liveness, place liveness, deadlock freedom
15 12/11 14:00-16:00 C1 Lecture 11 Petri nets as matrices: incidence matrix, Parikh vectors, Marking equation lemma, Monotonicity lemma, Boundedness lemma, Repetition lemma
16 14/11 11:00-13:00 C1 Lecture 12 Workflow nets: Soundness, N*, Main theorem, Strong connectedness theorem Woped
17 19/11 14:00-16:00 C1 Lecture 13
Lecture 14
Sound and safe WfN by construction
Invariants: S-invariants
18 21/11 11:00-13:00 C1 Lecture 14
Lecture 15
Invariants: T-invariants
Structural properties: S-systems, T-systems
19 26/11 14:00-16:00 C1 Lecture 16a
Lecture 16b
From EPC to WfN
From BPMN to WfN
20 28/11 11:00-13:00 C1 Lecture 17 aux
Lecture 17
P vs NP: Decision problems and complexity classes
Structural properties: Free-choice nets
21 03/12 14:00-16:00 C1 Lecture 18
Lecture 19
Worflow systems: workflow modules, relaxed soundness
Conformance measures
22 05/12 11:00-13:00 C1 Lecture V4 Conformance checking: how good is my model? How good is the log? (Prof. Vandin)
23 10/12 14:00-16:00 C1 Lecture 20 Workflow nets diagnosis: Woflan, ProM, coverability, error sequences Woped
Woflan
ProM
24 12/12 11:00-13:00 C1 Lecture 21 Quantitative analysis: Cycle time, Flow analysis, Little's law

Past courses