Kiepuszewski, B.; ter Hofstede, A.H.M.; Bussler, C.J.: On Structured Workflow Modelling. In: Wangler, B.; Bergman, L. (eds.): CAiSE 2000, LNCS 1789, 2000, pp. 431-445.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....J3 cond (H) M5 (F) PM4 PM5 M6 (G) PM6 Fig. 13. Join moving over and join (Unfold) 1 is the predecessor of M11 and M12, and M2 is the successor of M11 and M3 is the successor of M12. Predicates are adjusted. There are some more operations like moving and join over or join, introduced in [8], which as we can show is also an equivalence transformation. However, space limitations do not allow discussion of further transformations. 5 Related work There is some work on workflow transformations reported in literature. In [13] various workflow patterns for di#erent WFMS with di#erent ....

....(Unfold) 2 SWF : M1 (D) M2 (B) S1 cond (A) J1 cond (A) M3 (C) SWF : M2 (B) M11 (D) S1 cond (A) J1 cond (A) M12 (D) M3 (C) PM2 PM3 PM2 PM3 Fig. 15. Split moving before activity Modelling structured workflows and transforming arbitrary models to structured models has been addressed in [8], based on the equivalence notion of bisimulation. In that paper, the authors investigate transformations based on several patterns and analyze in which situations transformations can be applied. One of the specified transformations is moving split nodes, which is, in contrast to our work, ....

B. Kiepuszewski, A.H.M. ter Hofstede, and C. Bussler. On structured workflow modelling. Lecture Notes in Computer Science 1789. Springer, 1999.

No context found.

B. Kiepuszewski, A.H.M. ter Hofstede, and C. Bussler. On structured workflow modelling. In B. Wangler and L. Bergman, editors, Proc. of the 12th Int. Conference on Advanced Information Systems Engineering (CAiSE00), volume 1789 of LNCS, pages 431--445, Stockholm, Sweden, June 2000. Springer Verlag.

No context found.

B. Kiepuszewski, A.H.M. ter Hofstede, and C. Bussler. On structured workflow modelling. In B. Wangler and L. Bergman, editors, Proc. of the 12th Int. Conference on Advanced Information Systems Engineering (CAiSE00), volume 1789 of LNCS, pages 431--445, Stockholm, Sweden, June 2000. Springer Verlag.

....linkName= L1 13 target linkName= L2 . have completed its execution. In other words, link L captures an intermediate synchronization point between the two parallel threads Sa and Sb. This inter thread synchronization cannot be expressed using structured activities only (for a proof see [11]) Figure 1 illustrates the example in graphical form. 5 sequence name= Sa 7 source linkName= L 10 sequence name= Sb 13 target linkName= L A1 A2 B1 B2 Flow F Sa Sb L Legend: Activity Flow Sequence Link WP4 Exclusive Choice A point in the workflow ....

....but before the initiation of the instances has started. In WP15 the number of instances to be created is not known in advance: new instances are created on demand, until no more instances are required. For a discussion on non structured cycles that can not be unfolded into structured cycles see [11]. Example of WP15: When booking a trip, the activity book flight is executed multiple times if the trip involves multiple flights. Once all bookings are made, an invoice is sent to the client. How many bookings are made is only known at runtime through interaction with the user. Solutions, ....

B. Kiepuszewski, A.H.M. ter Hofstede, and C. Bussler. On structured workflow modelling. In B. Wangler and L. Bergman, editors, Proc. of the 12th Int. Conference on Advanced Information Systems Engineering (CAiSE00), volume 1789 of LNCS, pages 431--445, Stockholm, Sweden, June 2000. Springer Verlag.

....be captured using a combination of activities all and sequence, without using a synch activity as in Listing 5. For a proof that it is not possible to express the process described in Figure 1 by simply combining structured workflow constructs (i.e. all, switch, sequence, and while) we refer to [16, 15]. WP4 Exclusive Choice A point in the process where, based on a decision or workflow control data, one of several branches is chosen. Example: The manager is informed if an order exceeds 600, otherwise not. WP5 Simple Merge A point in the workflow process where two or more alternative branches ....

....14 . Listing 11 (MI without sync) 1 process name= MIwithoutSync1 3 property name= tns:set of objects 4 type= 6 . 9 foreach select= tns:set of objects 11 foreach For a discussion on non structured cycles that can not be unfolded into structured cycles see [16, 15]. Solution, WP11 Using the spawn activity type it is possible to have divergent branches which do not need to come together into a single point of termination, i.e. there is no need to join concurrent or conditional threads. Therefore, Implicit Termination is supported through the existence of ....

B. Kiepuszewski, A.H.M. ter Hofstede, and C. Bussler. On structured workflow modelling. In B. Wangler and L. Bergman, editors, Proc. of the 12th Int. Conference on Advanced Information Systems Engineering (CAiSE00), volume 1789 of LNCS, pages 431--445, Stockholm, Sweden, June 2000. Springer Verlag.

....motivation to look into the expressiveness of high level Petri nets (Section 3) and come up with a new language (Section 4) 2. 2 Lessons learned from comparing fundamentally different control flow mechanisms In this section we provide a brief overview of some of the main results presented in [29 31]. pattern product Staffware COSA InConcert Eastman FLOWer Domino Meteor Mobile 1 (seq) 2 (par spl) 3 (synch) 4 (ex ch) 5 (simple m) 6 (m choice) 7 (sync m) 8 (multi m) ....

B. Kiepuszewski, A.H.M. ter Hofstede, and C. Bussler. On structured workflow modelling. In B. Wangler and L. Bergman, editors, Proc. of the 12th Int. Conference on Advanced Information Systems Engineering (CAiSE00), volume 1789 of LNCS, pages 431--445, Stockholm, Sweden, June 2000. Springer Verlag.

....not occur if forks and joins were replaced with AND states. We argue that if activity diagrams are to be used as a workflow specification language, a precise definition of their well formedness is crucial, as it prevents several kinds of deadlocks. In a di#erent context than activity diagrams, [10] provides a formalisation of these well formedness rules. In this paper, we avoid the use of forks and joins, and use AND states instead. Forks and joins are only used in conjunction with synch state as discussed below. 2.3 Synch states A synch state is a synchronisation point between two ....

....such as data manipulation. The authors however do not formalise syntactical constraints such as the well formedness rules linking forks with joins, which are essential to avoid some deadlocking situations. These syntactical constraints and some of their expressive power implications are studied in [10]. To appear in UML 2001. 13 To summarise, we can state that the formalisation of the activity diagrams notation, and the evaluation of its suitability for workflow specification, are still open issues. It is expected that the ongoing OMG RFP UML extensions for workflow process definition [17] ....

B. Kiepuszewski, A.H.M. ter Hofstede, and C. Bussler. On structured workflow modelling. In Proc. of the Int. Conference on Advanced Information Systems Engineering (CAiSE), Stockholm, Sweden, June 2000. Springer Verlag.

No context found.

Kiepuszewski, B.; ter Hofstede, A.H.M.; Bussler, C.J.: On Structured Workflow Modelling. In: Wangler, B.; Bergman, L. (eds.): CAiSE 2000, LNCS 1789, 2000, pp. 431-445.

No context found.

Kiepuszewski, B.; ter Hofstede, A.H.M.; Bussler, C.J.: On Structured Workflow Modelling. In: Wangler, B.; Bergman, L. (eds.): CAiSE 2000, LNCS 1789, 2000, pp. 431-445.

No context found.

B. Kiepuszewski, A. ter Hofstede, and C. Bussler. On structured workflow modelling. In Proc. 12th Conf. on Advanced Information Systems Engineering (CAISE), Stockholm, Sweden, June 2000.

No context found.

B. Kiepuszewski, A. ter Hofstede and C. Bussler, "On Structured Workflow Modelling", Proceedings of CAISE 2000, Stockholm, Sweden.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC