Indice

Business Processes Modeling

MPB 2026/27 (295AA / 372AA, 6 cfu)

Lecturers: Roberto Bruni, Andrea Vandin

Contact: web Bruni - web Vandin

Office hours: Thursday 14:00-16: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 Links
1 Tue 15/09 09:00-11:00 C1 Lecture 1 Course introduction:
course objectives, textbooks, BPM aim and motivation, models and abstraction
2 Thu 17/09 16:00-18:00 A1 Lecture 2 Introduction to Business Processes:
Taylorism, work units, processes, terminology, organizational structures, process orientation and reengineering, visual notations
3 Tue 22/09 09:00-11:00 C1 Lecture 3 Exercises:
Alice-Bob car selling scenario

Examples:
Orchestration diagrams, collaboration diagrams, choreography diagrams
4 Thu 24/09 16:00-18:00 A1 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
5 Tue 29/09 09:00-11:00 C1 Lecture 5 Orchestration, choreography, collaboration diagrams VP
ARIS Express
yEd
Yaoqiang
BPMN.io
Camunda
Bizagi
6 Thu 01/10 16:00-18:00 A1 Lecture V1 Introduction to Process Mining with hands-on tutorial on Fluxicon Disco (Prof. Vandin) Disco
- Tue 06/10 09:00-11:00 C1 Canceled
7 Thu 08/10 16:00-18:00 A1 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 Tue 13/10 09:00-11:00 C1 Lecture 6 Process mining:
event logs, discovery, conformance, enhancement, perspectives, play-in, play-out, replay, overfitting, underfitting, footprint matrix, alpha-algorithm
- Thu 15/10 16:00-18:00 A1 Canceled
9 Tue 20/10 09:00-11:00 C1 Lecture 7a Process mining:
alpha-algorithm examples and exercises

EPC and BPMN guidelines
10 Thu 22/10 16:00-18:00 A1 Lecture V3 Formal introduction to dependency graphs and to the heuristic miner. Footprint-based conformance checking. (Prof. Vandin)
11 Tue 27/10 09:00-11:00 C1 Lecture 7b BPMN key features
- Thu 29/10 16:00-18:00 A1 Canceled
12 Tue 03/11 09:00-11:00 C1 Lecture 8 Petri nets: finite automata, nets, markings, firing
13 Thu 05/11 16:00-18:00 A1 Lecture V4 Conformance checking: how good is my model? How good is the log? (Prof. Vandin)
14 Lecture 9 Petri nets: occurrence graph, boundedness, coverability graph Woped
15 Lecture 10 Petri nets: Liveness, place liveness, deadlock freedom
16 Lecture 11 Petri nets as matrices: incidence matrix, Parikh vectors, Marking equation lemma, Monotonicity lemma, Boundedness lemma, Repetition lemma
17 Lecture 12 Workflow nets: Soundness, N*, Main theorem, Strong connectedness theorem Woped
18 Lecture 13
Lecture 14
Sound and safe WfN by construction
Invariants: S-invariants
19 Lecture 14
Lecture 15
Invariants: T-invariants
Structural properties: S-systems, T-systems
20 Lecture 16a
Lecture 16b
From EPC to WfN
From BPMN to WfN
21 Lecture 17 aux
Lecture 17
P vs NP: Decision problems and complexity classes
Structural properties: Free-choice nets
22 Lecture 18
Lecture 19
Worflow systems: workflow modules, relaxed soundness
Conformance measures
23 Lecture 20
Lecture 21
Quantitative analysis: Cycle time, Flow analysis, Little's law

Workflow nets diagnosis: Woflan, ProM, coverability, (optional: error sequences)
Woped
Woflan
ProM

Past courses