Free schedules for free agents in workflow systems

Proceedings Seventh International Workshop on Temporal Representation and Reasoning. TIME 2000 Pub Date : 2000-07-07 DOI:10.1109/TIME.2000.856582

C. Bettini, X. Wang, S. Jajodia

{"title":"Free schedules for free agents in workflow systems","authors":"C. Bettini, X. Wang, S. Jajodia","doi":"10.1109/TIME.2000.856582","DOIUrl":null,"url":null,"abstract":"This paper investigates workflow systems in which the enactment and completion of activities have to satisfy a set of quantitative temporal constraints. Different activities are usually performed by autonomous agents, 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 its 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.","PeriodicalId":130990,"journal":{"name":"Proceedings Seventh International Workshop on Temporal Representation and Reasoning. TIME 2000","volume":"111 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Seventh International Workshop on Temporal Representation and Reasoning. TIME 2000","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TIME.2000.856582","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 10

Abstract

This paper investigates workflow systems in which the enactment and completion of activities have to satisfy a set of quantitative temporal constraints. Different activities are usually performed by autonomous agents, 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 its 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.

查看原文本刊更多论文

工作流系统中自由代理的免费时间表

本文研究了工作流系统，其中活动的制定和完成必须满足一组定量的时间约束。不同的活动通常由自主代理执行，而制定服务的活动调度的目标之一是最小化代理之间的通信和同步。本文正式定义了这些工作流系统的调度概念，并确定了一个特别有用的类:自由调度。时间表为每个活动的制定、持续时间和完成指定一个时间范围，以满足工作流中的所有时间约束。在自由调度中，代理必须在调度中指定的范围内启动其活动，但它可以自由地使用任何数量的时间来完成活动，只要它在设计工作流时声明的最小和最大时间之间。不需要与其他代理进行同步。本文提供了一种描述工作流规范所允许的所有自由调度的方法和导出它们的算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Proceedings Seventh International Workshop on Temporal Representation and Reasoning. TIME 2000

自引率

0.00%

发文量