Composing Time-Aware Web Service Orchestrations

Pichler, Horst; Wenger, Michaela; Eder, Johann

doi:10.1007/978-3-642-02144-2_29

Cited by 22 publications

(8 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…8,9,16,17,24,29,34 It has been investigated, for example, how to capture time aspects at design time, in particular, to cover uncertainty of processing times and to determine critical paths. At runtime, adherence of the process instances to imposed time restrictions such as deadlines is monitored.…”

Section: Related Workmentioning

confidence: 99%

Application of Dynamic Instance Queuing to Activity Sequences in Cooperative Business Process Scenarios

Pflug

Rinderle-Ma

2016

Int. J. Coop. Info. Syst.

View full text Add to dashboard Cite

The optimization of their business processes is a crucial challenge for many enterprises. This applies especially for organizations using complex cooperative information systems to support human work, production lines, or computing services. Optimizations can touch different aspects such as costs, throughput times, and quality. Nowadays, improvements in workflows are mostly achieved by restructuring the process model. However, in many applications there is a huge potential for optimizations during runtime as well. This holds particularly true for collaborative processes with critical activities, i.e. activities that require a high setup or changeover time, typically leading to waiting queues in instance processing. What is usually suggested in this situation is to bundle several instances in order to execute them as a batch. How the batching is achieved, however, has been only decided on static rules so far. In this paper, we feature dynamic instance queuing (DIQ) as an approach towards clustering and batching instances based on the current conditions in the process, e.g. attribute values of the instances. Specifically, we extend our previous work on applying DIQ at single activities towards a queuing approach that spans activity sequences (DIQS). The approach is evaluated based on a real-world case study from the manufacturing domain. We discuss limitations and further applications of the DIQ idea, e.g. with respect to collaborative human tasks.

show abstract

Section: Related Workmentioning

confidence: 99%

Application of Dynamic Instance Queuing to Activity Sequences in Cooperative Business Process Scenarios

Pflug

Rinderle-Ma

2016

Int. J. Coop. Info. Syst.

View full text Add to dashboard Cite

show abstract

“…This model enables time verification process against the time requirements based on model checking techniques. In [41], the authors modelled the time elements together with the process based on the workflow model to compute and predict time in avoiding deadline violations. From the service procurement, the time properties has been modelled as part of Quality Requirements Language (QRL) [42].…”

Section: Time Modelling and Analysismentioning

confidence: 99%

Incremental service level agreements violation handling with time impact analysis

Ismail

Yan

Shen

2013

Journal of Systems and Software

View full text Add to dashboard Cite

“…Time aspects in PAIS: Since time aspects constitute a major challenge for modeling and execution of business processes different approaches address this issue [5,6,11,12,20,24,21]. It has been investigated, for example, how to capture time aspects at design time, in particular, to cover uncertainty of processing times and to determine critical paths.…”

Section: Related Workmentioning

confidence: 99%

Dynamic instance queuing in process-aware information systems

Pflug

Rinderle-Ma

2013

Proceedings of the 28th Annual ACM Symposium on Applied Computing

View full text Add to dashboard Cite

Reducing the processing time of instances at critical activities is essential for many application domains. We refer to an activity as being critical if due to restricted resources assigned to the activity, the arrival of a certain number of process instances might lead to a waiting queue. So far, queuing has been adopted for process optimization in a merely static manner, i.e., the strategy in which order the instances are processed from the queue is fixed. We argue that determining the processing strategy for instance queues at runtime (dynamic queuing) offers the potential to reduce the processing time at critical activities. The core idea is that instances arriving at critical activities are first clustered based on similar features and are then distributed to dynamic queues accordingly. The decision on the processing order for the resulting queues requires a state management for allocating the appropriate number of resources during runtime. For this, a configurable performance index is used. The proposed dynamic queuing approach is prototypically implemented and evaluated based on a realistic data set.

show abstract

Composing Time-Aware Web Service Orchestrations

Cited by 22 publications

References 19 publications

Application of Dynamic Instance Queuing to Activity Sequences in Cooperative Business Process Scenarios

Application of Dynamic Instance Queuing to Activity Sequences in Cooperative Business Process Scenarios

Incremental service level agreements violation handling with time impact analysis

Dynamic instance queuing in process-aware information systems

Contact Info

Product

Resources

About