قواعد تقلیل حفظ تفکر صحیح برای تنظیم مجدد شبکه جریان کار
|کد مقاله||سال انتشار||مقاله انگلیسی||ترجمه فارسی||تعداد کلمات|
|21819||2009||22 صفحه PDF||سفارش دهید||محاسبه نشده|
Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)
Journal : Information Sciences, Volume 179, Issue 6, 1 March 2009, Pages 769–790
The application of reduction rules to any Petri net may assist in its analysis as its reduced version may be significantly smaller while still retaining the original net’s essential properties. Reset nets extend Petri nets with the concept of a reset arc, allowing one to remove all tokens from a certain place. Such nets have a natural application in business process modelling where possible cancellation of activities need to be modelled explicitly and in workflow management where such process models with cancellation behaviours should be enacted correctly. As cancelling the entire workflow or even cancelling certain activities in a workflow has serious implications during execution (for instance, a workflow can deadlock because of cancellation), such workflows should be thoroughly tested before deployment. However, verification of large workflows with cancellation behaviour is time consuming and can become intractable due to the state space explosion problem. One way of speeding up verification of workflows based on reset nets is to apply reduction rules. Even though reduction rules exist for Petri nets and some of its subclasses and extensions, there are no documented reduction rules for reset nets. This paper systematically presents such reduction rules. Because we want to apply the results to the workflow domain, this paper focusses on reset workflow nets (RWF-nets), i.e. a subclass tailored to the modelling of workflows. The approach has been implemented in the context of the workflow system YAWL.
The analysis of a non-trivial concurrent process is a complicated task. There are a number of different approaches to deal with this complexity. Reducing a specification, while preserving its essential properties with respect to a particular analysis problem, is one such approach. There exists a body of research that addresses the concept of reduction in the area of Petri nets (see, e.g.,  and ) and its various subclasses (see, e.g., free-choice nets ) and extensions (see, e.g., timed petri nets ). Reset nets , , ,  and  extend Petri nets with the concept of a reset arc, a type of arc that connects a place and a transition and which semantics is to remove all tokens from that place when the transition fires. The complexity introduced by a reset arc (when compared with Petri nets in general) is threefold: (1) as the transition removes all tokens and not just one, place invariants do not hold for such nets, (2) the reset action can be ineffective if a place does not contain any tokens at the exact time when the transition fires and the reset action is carried out, and (3) a reset arc can affect any place in the entire net (i.e., its effect is global), unlike normal arcs of a transition which can only influence their input and output places (i.e., their effect is local). As a result, the notion of reachability is undecidable for reset nets with more than two reset arcs . Reset nets form a natural foundation for workflow languages with explicit support for cancellation. Cancellation is an important concept in workflow management (see, e.g., ) where the execution of some activities may lead to the termination of other activities in certain circumstances. Cancellation can be triggered by either a customer request (e.g., a customer wishes to withdraw a credit card application) or by exceptions (e.g., an order cannot be processed due to insufficient stock level). In general, cancellation results in one of two outcomes: disabling some scheduled activities or stopping currently running activities. The complicating factor is that due to concurrency issues, the cancellation action may or may not result in cancelling certain activities, i.e., the process may be in a state before or after the part that is supposed to be cancelled. This can introduce deadlocks (the state where a business process is stuck and cannot proceed). As it is important to detect errors in workflows before their deployment, it is desirable to speed up the analysis of workflows if possible. When this analysis is performed on reset nets, corresponding to the workflows involved, this boils down to being able to perform efficient reset net analysis. While there are potentially a number of avenues that could be explored in order to achieve this, one approach is the application of reduction rules for reset nets. When reducing a net it is imperative that certain essential properties are preserved. In the area of workflow verification, soundness is such a property. Soundness is a correctness notion of workflows that requires that a workflow can always terminate, that when termination is signalled no other tokens remain elsewhere in the net, and that it does not contain any dead tasks . A reset workflow net (RWF-net) is a reset net with three structural restrictions: there is exactly one source node, one sink node and every node in the graph is on a directed path from the source node to the sink node. See Fig. 1 for an example of a sound RWF-net. In Fig. 1, transition t can remove tokens from places a, b, and c when it fires (denoted by double-headed arcs). By applying reduction rules, it is possible to reduce the net while preserving the soundness property of the net as shown in Fig. 2, where transition y corresponds to transition t and its successors in the original net and place v replaces all three places a, b, and c.In this paper a number of soundness-preserving reduction rules for RWF-nets are documented and proven correct. They are inspired by reduction rules provided for Petri nets in  and  and for free-choice Petri nets provided in . As mentioned before, there are no documented reduction rules for reset nets that preserve soundness in the current literature, and as it turns out, one has to be careful in determining the conditions under which certain types of reductions can be applied. For example, because of the nature of reset arcs removing all tokens when a transition fires, it is possible that an incorrect net that does not satisfy the proper completion criterion (i.e. tokens can be left in the net when it reaches the end) becomes sound when there is a reset arc to remove the leftover tokens before completion. Another interesting finding is that strict conditions are necessary for reset net reduction rules (for instance, two places can only be reduced to one if and only if both places are reset by the same transition). Hence, the presence of reset arcs does not offer new possibilities for reduction, rather it limits them. Also, a reset arc can never be abstracted entirely from a reset net. That is, if a net contains reset arcs, it is not possible to obtain a reduced net without any reset arc. Hence, the goal of reduction is to reduce the number of reset arcs when these arcs are connected to more than one place or transition and as a result, to reduce the complexity introduced by multiple reset arcs. The contributions of the paper are as follows: – The set of reset net reduction rules represents a practical contribution to achieve a more efficient verification of complex workflows with cancellation behaviours. The rules have been implemented as part of the verification functionality of the workflow language YAWL.1 – The reduction rules presented in this paper have wider applicability than the area of workflow verification. They are equally applicable to other business process modelling languages that support cancellation such as the business process modelling notation (BPMN), the business process execution langauge (BPEL) and the unified modelling language (UML). – The paper also aims to make a contribution to the body of theory in reset nets. The set of reduction rules presented in this paper are liveness and boundedness preserving as well as soundness preserving. The organisation of the rest of the paper is as follows. Section 2 provides the formal foundation by introducing reset nets and RWF-nets. Section 3 introduces a simplified credit card application process with cancellation feature and demonstrates how it can be modelled as a RWF-net. Section 4 describes a set of reduction rules for RWF-nets. Section 5 briefly mentions the implementation of the rules in the workflow language YAWL. Section 6 discusses the related work and Section 7 concludes the paper.
نتیجه گیری انگلیسی
In this paper, seven reduction rules for a subclass of reset nets, RWF-nets, were proposed and proven to be correct with respect to the soundness property, a well-established correctness notion in the context of workflow specification. These reduction rules for RWF-nets were inspired by earlier reduction rules for Petri nets without reset arcs (except for the fusion of equivalent subnets rule). As mentioned in the introduction, a reset arc introduces significant complexities when determining the correct behaviour of a net. This is reflected by the addition of extra context conditions in the reduction rules. It is perhaps not a surprise that reset arcs do not offer new possibilities for reduction rather they limit them. In most cases, the conditions ensure that (1) the place or transition that is removed from the net is not connected to a reset arc or (2) all places and transitions that are merged are connected to the same node via a reset arc. We also demonstrated how a business process model with cancellation feature can be reduced using the proposed reduction rules. The proposed reduction rules have found a practical application in the YAWL open source workflow management system, which provides support for cancellation regions, for the purposes of speeding up verification and reducing the state space. Even though the paper focuses on a subclass of reset nets, RWF-nets, the reduction rules presented for RWF-nets in this paper can be generalised beyond RWF-nets and the rules are equally applicable to arbitrary reset nets (cf. Section 4). As the requirements for these rules ensure that occurrence sequences in the original net and the reduced net correspond to each other, these reduction rules are liveness and boundedness preserving.