BPMN Meets DMN: Business Process and Decision ModelingProf. Dr. Mathias Weske
Dieses Video gehört zum openHPI-Kurs BPMN Meets DMN: Business Process and Decision Modeling. Möchten Sie mehr sehen? Schreiben Sie sich kostenlos ein!

3.7 Checking Soundness

Zeitaufwand: etwa 20 Minuten
Sie verwenden unseren alten Videoplayer. Möchten Sie auf unseren neuen Videoplayer wechseln?

Über dieses 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.