本视频属于openHPI课程Business Processes: Modeling, Simulation, Execution。你想看更多吗？
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.
需要使用字幕时，请在视频播放器设置中选择一种语言。
关于这个视频
<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.