Business Processes: Modeling, Simulation, ExecutionProf. Dr. Mathias Weske
This video belongs to the openHPI course Business Processes: Modeling, Simulation, Execution. Do you want to see more? Enroll yourself for free!

3.7 Checking Soundness

Time effort: approx. 20 minutes
You are using our new video player. If you experience any problems, please contact the helpdesk. You can always switch to the old player.

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>

Remark: Slide 3-72 states that the second soundness property of the corresponding Petri net is violated. This is not correct. We did a mistake here and have to apologize for that. Only property 1 & 3 is violated in this case.