3.7 Checking Soundness

Please enable Javascript in your browser!!

This video belongs to the openHPI course Business Process Modeling and Analysis (2013). Do you want to see more?

An error occurred while loading the video player, or it takes a long time to initialize. You can try clearing your browser cache. Please try again later and contact the helpdesk if the problem persists.

About this video

<p>Based on a transformation of BPMN to Petri nets, the reachability graph of a process (its state space) is built and analyzed for soundness properties. For instance, it is examined if the final state can always be reached and whether all transitions can contribute to a process instance.</p>

Go to overview

Week 1
- Welcome to the openHPI Course Archive
- Introduction to Business Process Management
- 1.1 Defining Business Processes
- 1.1 Defining Business Processes
- 1.2 On Modeling
- 1.2 On Modeling
- 1.3 Business Process Models
- 1.3 Business Process Models
- 1.4 Interacting Business Processes
- 1.5 Models and Instances
- 1.6 Levels of Process Models
- 1.7 Business Process Lifecycle
- 1.7 Business Process Lifecycle
- Course Outline
Week 2
- 2.1 Fundamentals of Modeling Languages
- 2.1 Fundamentals of Modeling Languages
- 2.2 Process Activities
- 2.3 Exclusive and Parallel Gateways
- 2.4 Inclusive Gateways and Loops
- 2.4 Inclusive Gateways and Loops
- 2.5 Start Events and End Events
- 2.6 Intermediate Events
- 2.6 Intermediate Events
Week 3
- 3.1 Process Behavior
- 3.2 Structural Soundness
- 3.3 Soundness Explained
- 3.4 Simulating Business Processes
- 3.4 Simulating Business Processes
- Modeling Task (Week 3)
Bonus
- 3.5 Informal Petri Net Primer
- 3.5 Informal Petri Net Primer
- 3.6 Mapping BPMN to Petri Nets
- 3.7 Checking Soundness
- 3.7 Checking Soundness
Week 4
- Advanced Business Process Modeling
- 4.1 Sub-Processes
- 4.1 Sub-Processes
- 4.2 Sub-Processes and Boundary Events
- 4.2 Sub-Processes and Boundary Events
- 4.3 Activity Modifiers
- 4.4 Racing Events
- 4.5 Modeling Organization
- 4.5 Modeling Organization
- 4.6 Resource Allocation Patterns
- Modeling Task (Week 4)
- Extra Clip E1 - Concurrent execution
Week 5
- Data in Business Processes
- 5.1 Organizing Process Models
- 5.2 Data and Data Flow
- 5.2 Data and Data Flow
- 5.3 Data Execution Semantics
- 5.3 Data Execution Semantics
- 5.4 Structured Data and Sub-Processes
- 5.5 Object Lifecycle Conformance
- 5.5 Object Lifecycle Conformance
- Modeling task (Week 5)
Week 6
- Process Choreographies
- 6.1 From Orchestrations to Choreographies
- 6.1 From Orchestrations to Choreographies
- 6.2 Collaboration Diagrams
- 6.2 Collaboration Diagrams
- 6.3 Public and Private Processes
- 6.3 Public and Private Processes
- 6.4 Choreography Diagram Basics
- 6.4 Choreography Diagram Basics
- 6.5 Events and Gateways in Choreography Diagrams
- 6.5 Events and Gateways in Choreography Diagrams
- Modeling Task (Week 6)
Exam
- E2 -Course Overview and Final Exam
- Participant Survey