A Data Warehousing Architecture for Enabling Service Provisioning Process
Proceedings of the 27th International Conference on Very Large Data Bases
Architectures for a temporal workflow management system
Proceedings of the 2004 ACM symposium on Applied computing
Extending the data warehouse for service provisioning data
Data & Knowledge Engineering - Special issue: ER 2003
A Technique for the Prediction of Deadline-Violations in Inter-Organizational Business Processes
Proceedings of the 2007 conference on Databases and Information Systems IV: Selected Papers from the Seventh International Baltic Conference DB&IS'2006
Composing Time-Aware Web Service Orchestrations
CAiSE '09 Proceedings of the 21st International Conference on Advanced Information Systems Engineering
| Hi-index | 0.00 |
This paper investigates workflow systems in which the enactment and completion of activities have to satisfy a set of quantitative temporal constraints. Autonomous agents usually perform different activities, and the scheduling of activities by the enactment service has among its goals the minimization of communication and synchronization among the agents. The paper formally defines the notion of a schedule for these workflow systems and it identifies a particularly useful class: 驴free schedules驴. A schedule specifies a time range for the enactment, duration, and completion of each activity in order to satisfy all the temporal constraints in the workflow. In a free schedule, an agent has to start its activity within the range specified in the schedule, but it is free to use any amount of time to finish the activity as long as it is between a minimum and maximum time he has declared when the workflow is designed. No synchronization with other agents is needed. The paper provides a method to characterize all the free-schedules admitted by a workflow specification, and an algorithm to derive them.