| B. Kiepuszewski. Expressiveness and Suitability of Languages for Control Flow Modelling in Workflows. Ph.D. Thesis, Queensland University of Technology, 2002. |
....is important that such relations are fully formalized. Formally defined Business Process Modeling Languages can be compared in terms of their expressive power. For some classes of workflow modeling languages, abstractions of some existing approaches, comparative expressiveness has been studied in [21, 20]. These results are in the context of a specific notion of equivalence, addressing the issue of when two workflow models can be considered expressing the same workflow. Expressiveness results give insight into what can and cannot be expressed in some approaches and more research is needed in this ....
B. Kiepuszewski. Expressiveness and Suitability of Languages for Control Flow Modelling in Workflows (submitted). PhD thesis, Queensland University of Technology, Brisbane, Australia, 2002. Available via http://www.tm.tue.nl/it/research/patterns.
....language is Turing complete. Therefore, it makes to sense to compare these languages using for mal notions of expressiveness. Instead we use a more intuitive notion of expressiveness which takes the modeling effort into account. This more intuitive notion is often referred to as suitability. See [27] for a discussion on the distinction between formal expressiveness and suitability. The observation that the expressive power of the available workflow management systems leaves much to be desired, triggered the question: How about high level Petri nets (i.e. Petri nets extended with color, ....
B. Kiepuszewski. Expressiveness and Suitability of Languages for Control Flow Modelling in Workflows. PhD thesis, Queensland University of Technology, Brisbane, Australia, 2002.
....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. Expressiveness and Suitability of Languages for Control Flow Modelling in Workflows (Submitted). PhD thesis, Queensland University of Technology, 2002. http://www.tm.tue.nl/it/research/patterns.
....language is Turing complete. Therefore, it makes no sense to compare these languages using formal notions of expressiveness. Instead we use a more intuitive notion of expressiveness which takes the modelling effort into account. This more intuitive notion is often referred to as suitability. See [29] for a discussion on the distinction between formal expressiveness and suitability. The observation that the expressive power of the available workflow management systems leaves much to be desired, triggered the question: How about high level Petri nets (i.e. Petri nets extended with colour, ....
....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) ....
[Article contains additional citation context not shown here]
B. Kiepuszewski. Expressiveness and Suitability of Languages for Control Flow Modelling in Workflows (submitted). PhD thesis, Queensland University of Technology, Brisbane, Australia, 2002. Available via http://www.tm.tue.nl/it/research/patterns.
....it. Most of the systems require the workflow designer to replace OR splits and OR joins by AND XOR splits and AND XOR joins. However, there are also systems that directly offer constructs that resemble the OR join as discussed in this paper. For an overview of these systems we refer to [AHKB02, Kie02] where 15 systems are evaluated on the basis of 20 workflow patterns. Pattern 7, also referred to as the synchronizing merge, corresponds to the OR join with a non local semantics. The synchronization merge is fully or partially supported by InConcert, Eastman, Domino Workflow, eProcess, and ....
B. Kiepuszewski. Expressiveness and Suitability of Languages for Control Flow Modelling in Workflows (submitted). PhD thesis, Queensland University of Technology, Brisbane, Australia, 2002.
No context found.
B. Kiepuszewski. Expressiveness and Suitability of Languages for Control Flow Modelling in Workflows. Ph.D. Thesis, Queensland University of Technology, 2002.
No context found.
B. Kiepuszewski. Expressiveness and Suitability of Languages for Control Flow Modelling in Workflows. PhD thesis, Queensland University of Technology, Brisbane, Australia, 2003. Available via http://www.tm.tue.nl/it/research/patterns.
No context found.
B. Kiepuszewski. Expressiveness and Suitability of Languages for Control Flow Modelling in Workflows (submitted). PhD thesis, Queensland University of Technology, Brisbane, Australia, 2002. Available via http://www.tm.tue.nl/it/research/patterns.
No context found.
B. Kiepuszewski. Expressiveness and Suitability of Languages for Control Flow Modelling in Workflows. PhD thesis, Queensland University of Technology, Brisbane, Australia, 2002. Available via http://www.tm.tue.nl/it/research/patterns.
No context found.
B. Kiepuszewski. Expressiveness and Suitability of Languages for Control Flow Modelling in Workflows (submitted). PhD thesis, Queensland University of Technology, Brisbane, Australia, 2002. Available via http://www.tm.tue.nl/it/research/patterns.
No context found.
B. Kiepuszewski. Expressiveness and Suitability of Languages for Control Flow Modelling in Workflows. PhD thesis, Queensland University of Technology, Brisbane, Australia, 2003. Available via http://www.tm.tue.nl/it/research/patterns.
No context found.
B. Kiepuszewski. Expressiveness and Suitability of Languages for Control Flow Modelling in Work- flows. PhD thesis, Queensland University of Technology, Brisbane, Australia, 2003. Available via http://www.tm.tue.nl/it/research/patterns.
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