BPMN Meets DMN: Business Process and Decision ModelingProf. Dr. Mathias Weske

本视频属于openHPI课程BPMN Meets DMN: Business Process and Decision Modeling。你想看更多吗?

3.7 Checking Soundness

时间效果趋于.20 分钟

关于这个视频


<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.