In: Lecture Notes in Computer Science : Petri Nets and Other Models of Concurrency - ICATPN 2006, Volume 4024, 2006, pages 381-390. 2006. URL: http://dx.doi.org/10.1007/1176758921.
Abstract: This paper describes the verification module (the VipVerify Module) of the VipTool [4]. VipVerify allows to verify whether a given scenario is an execution of a system model, given by a Petri net. Scenarios can be graphically specified by means of Labeled Partial Orders (LPOs). A specified LPO is an execution of a Petri net if it is a (partial) sequentialization of an LPO generated by a process of the net. We have shown in [2] that the executability of an LPO can be tested by a polynomial algorithm. The VipVerify Module implements this algorithm. If the test is positive, the corresponding process is computed and visualized. If the test is negative, a maximal executable prefix of the LPO is computed and visualized, together with a corresponding process and the set of those following events in the LPO which are not enabled to occur after the occurrence of the prefix. Further, the VipVerify Module allows to test in polynomial time whether a scenario equals an execution with minimal causality. A small case study illustrates the verification of scenarios w.r.t. business process models.