面向目标的迁移工作流主动服务方法研究
|
摘要
迁移工作流(Migrating Workflow)是将移动agent计算模式应用于工作流管理的一门新技术。与传统的工作流模型不同,迁移工作流是一个或多个迁移实例(Migrating Instance)在不同工作位置(Work Place)之间不断迁移并就地利用工作位置服务执行业务活动的过程,其中,迁移实例是工作流活动的主体,工作位置是工作流联盟成员服务在网络上的节点映射。工作流联盟上所有工作位置的集合称作迁移工作流环境,为了与本文研究相区别,文中称为单工作位置环境。目前的迁移工作流研究主要采用面向过程的方法,即令迁移实例携带业务过程说明书工作。业务过程说明书中固有的结构化属性,不可避免地会限制迁移实例求解问题的灵活性,降低其对环境动态变化的适应性。
为了克服面向过程的迁移工作流方法的不足,在面向目标的迁移工作流模型中,迁移实例携带工作流目标说明书工作。工作流目标既可以通过迁移实例自身的服务发现实现,也可以通过工作位置的服务推荐实现(本文称工作位置对迁移实例的工作位置导航和工作流资源推荐为迁移工作流主动服务)。当工作流目标可以分解为多个业务子目标时,对于并行的业务子目标,不同的迁移实例可以在不同的工作位置上生成并首先在该工作位置运行。因为面向目标的迁移工作流可以大大提高迁移实例对工作环境动态变化的适应性,因此特别适合那些活动及其转移规则难于完全定义的跨机构业务过程。
本文针对单工作位置环境上主动服务能力不足的问题,在国家自然科学基金项目的资助下,以曾广周教授提出的迁移工作流系统框架为基础,研究了一类面向目标的迁移工作流主动服务方法,包括:基于业务熟人域的迁移工作流主动服务环境构建方法,业务熟人域上面向目标的迁移实例导航服务方法,业务熟人域上面向目标的迁移工作流资源服务推荐方法,业务熟人域上多服务主体收益分配方法,并通过实验对研究成果进行了验证和分析。
本文的主要工作包括:
1.面向目标的迁移工作流主动服务环境构建方法研究。
针对单工作位置环境上主动服务能力不足的问题,本文借鉴人类社会中的“小世界现象”,提出了一种基于业务熟人域的迁移工作流主动服务环境构建方法。方法的基本思想是:首先依据成员合作关系的类型和性质,将工作流联盟上的成员划分为面向目标的“小世界”(称为业务熟人域)集合;然后通过业务熟人域之间的成员合作关系,将工作流联盟上的成员集合映射为一个业务熟人网络,该业务熟人网络即为面向目标的迁移工作流主动服务环境。文中重点讨论了业务熟人域的可构造性质,给出了业务熟人域的构造算法和演化策略。实验表明,基于业务熟人域为迁移实例提供主动服务,较之单工作位置服务有更高的服务能力。
2.面向目标的迁移工作流服务导航方法研究。
在面向目标的迁移工作流模型中,服务导航是指当前工作位置向迁移实例推荐下一个合适的工作位置,工作位置上的导航主体既可以有全局工作流视图,也可以没有全局工作流视图。本文只研究导航主体缺少全局工作流视图的情况,因此,对服务导航方法的最低要求是不能造成迁移实例迷航而使迁移工作流中断。针对业务熟人域上导航主体缺少全局工作流视图的问题,本文视业务熟人域为当前导航主体部分可观测的工作流环境,采用POMDP方法,提出了一种基于业务熟人域的服务导航模型,定义了目标关联策略描述规范,给出了服务导航索的生成算法和目标驱动的服务导航算法。实验表明,基于业务熟人网进行服务导航,可以有效避免迁移实例迷航,并具有较高的导航效率和导航可靠性。
3.面向目标的迁移工作流资源服务推荐方法研究。
在面向目标的迁移工作流模型中,工作流资源服务推荐是指王作位置向迁移实例推荐那些能够满足工作流目标的数据、程序、工具和用户,以帮助迁移实例高效地完成那些需要在本地执行的任务。如果工作位置上的工作流资源服务能力受限,轻则会影响工作流进程的速度,重则会造成工作流进程停滞。针对单工作位置上资源服务能力不足的问题,本文建立了一种基于业务熟人域的多主体工作流资源服务推荐方法。为了快速实现成员间的资源服务分担,本文重点研究了成员发现和群组织中的通信协议问题。实验表明,本文建立的通信协议,可以有效提高基于业务熟人域的多主体资源服务推荐效率,具有很好的服务可靠性。
4.面向目标的迁移工作流多服务主体收益分配方法研究。
业务熟人域上的迁移工作流主动服务,本质上是一种多主体联合主动服务。为了保证多主体之间的稳定合作,本文针对现有研究成果中收益分配策略对收益补偿评估的不足,提出了一种基于动态合作博弈的多主体收益分配策略。策略的基本思想是:将多主体收益分配问题形式化为一个多人动态合作博弈,通过寻求动态合作博弈中马尔可夫完美均衡计算多主体的收益补偿,并利用补偿协调多服务主体最优收益分配。文中定义了多主体共识原则,给出了业务熟人域上的收益分配算法。实验表明,本文提出的收益分配策略能够使多服务主体根据最优共识原则,分配各方的合作收益,从而达到多赢的帕累托最优局面。
本文工作的创新点主要体现在:
1.针对单工作位置环境主动服务能力不足的问题,提出了一种基于业务熟人域的迁移工作流主动服务环境模型。
业务熟人域是工作流联盟成员集合上面向服务目标的成员子集,其“小世界”性质使得业务熟人域容易构造和演化。由业务熟人域互连而成的业务熟人网络,覆盖工作流联盟上的所有成员和服务,因而可以保证迁移实例有一个目标可达的动态工作环境。与单工作位置环境相比,业务熟人域上不仅蕴含了更强的多主体联合服务能力,而且可以使迁移实例在同一个业务熟人域上就近尽可能地完成多个工作流子目标,从而提高执行效率。
2.针对业务熟人域上服务主体缺少全局工作流视图的问题,提出了一种部分可观测环境下的迁移工作流服务导航方法。
在面向目标的迁移工作流模型中,业务熟人域上的工作流视图是导航主体唯一可见的局部工作流视图,或称作导航主体部分可观测的迁移工作流环境。与基于全局工作流视图的服务导航模型和算法相比,本文建立的部分可观测环境下的迁移工作流服务导航方法,不仅可以使工作流设计者摆脱全局工作流视图难以完善定义的困境,而且能够使迁移实例尽可能地在业务熟人域上迁移和就地工作,因而既可以有效规避迷航风险,也可以提高工作流效率。
3.针对业务熟人域上的合作稳定性问题,提出了基于动态合作博弈的多主体收益分配策略。
业务熟人域上的服务主体都是理性的工作流参与者,他们在追求工作流全局目标的同时,必定关注自己的收益,因此,合理的收益分配是保持业务熟人域稳定的基础。与现有研究成果中的收益分配策略相比,本文提出的基于动态合作博弈的多主体收益分配策略,弥补了现有策略对收益补偿评估的不足,实现了服务主体收益的最优化分配,因而有利于保持业务熟人域上的合作稳定性。
本文进一步的工作包括:建立业务熟人网络的演化策略,用以支持主动服务异常的处理与故障恢复,提高迁移工作流的可达性和可靠性;建立业务熟人域上协同导航索的趋同性生成方法,用以消除多导航主体之间存在的导航意图和导航方法差异,提高业务熟人域上联合服务导航的健壮性和效率。
Migrating workflow is an emerging technology that applies the mobile-agent computing paradigm to workflow management. Different from the traditional workflow model, migrating workflow is a process in which one or more migrating instances migrate continuously and utilize local workflow service to execute their tasks. Migrating instance is a performing agent of tasks. Work place is mapped to the network node, which is one of workflow participants. The set of all work places is called as migrating workflow environment in the workflow alliance, which is called the single work place environment in this thesis. Research in the field of process-oriented migrating workflows has primarily focused on workflow specifications. However, inherent structurized attributes in workflow specifications will limit the flexibility of migrating instances to solve questions inevitably, and reduce the compatibility to the dynamic environment.
In order to overcome the shortage of workflow process-oriented approach, migrating instances run with workflow specifications in the goal-oriented migrating workflow. The migrating workflow goal is realized by migrating instace's service discovery or work place's service recommendation (Migrating instances are recommend with work place and workflow resource is called migrating workflow active service in this thesis). A complex business goal is composed by a number of sub-goals. For different business processes goals, different migrating instances generat and run in the work place. Therefore, goal-oriented migrating workflow improves workflow system's flexibility to adapt to dynamic environment, especially for the concurrent distributed business processes.
This study was mainly supported by the National Natural Science Foundation of China under Grant and based on the migrating workflow framework proposed by professor ZENG This thesis focused on the methods of goal-oriented migrating workflow active service: a conformation method of the goal-oriented migrating workflow service environment based on business acquaintance domain, a migrating instance service navigation method for goal-oriented migrating workflow, a resource service recommendation method for goal-oriented migrating workflow and a profit allocation method of multi-service-agent for goal-oriented migrating workflow. The study has also built experiments to validate the conclusions.
The main contributions of this thesis are described as follows:
1. A conformation method of active service environment for goal-oriented migrating workflows.
Aiming at the question of insufficient active service ability of single "work place, this thesis borrowed the "small world phenomenon" of the social groups and provided the method of constructing the active service environment for workflows. The basic idea of this method is: Firstly, based on the member cooperation's type and the nature, members of migrating workflow will be divide into the goal-oriented "small world"sets (called service acquaintance domain); Then through the members of service acquaintance domains cooperating, the workflow member sets will be mapped as a service acquaintance network, which is called as active service environment for goal-oriented migrating workflow. In this thesis, we discussed the nature of service acquaintance domain, gave the strategy of construction and evolvement of acquaintance domain. Moreover, the experiments indicated that the active service based on the business acquaintance domain has the higher service ability than sigle work place.
2. A service navigation method for goal-oriented migrating workflows.
Service navigation means the current work place recommend the next work place for migrating instance. The navigation agent in the work place has a full or part workflow view. This thesis only studied on the navigation agent lacking of full workflow view. In order to meet the rich of services for the goal-oriented migrating workflow, we established POMDP method. This thesis proposed a service navigation model with the business acquaintance mechanism in partially observable environment, analysed service actors to meet the users, gave a service navigation strategy and proposed the arithmetic to build a service navigation cable. The experiment indicated that the sevice navigation based on service acquaintance domain did not enable migrating instance to get lost.
3. A resource service recommendation method for goal-oriented migrating workflows.
In goal-oriented migrating workflows model, resource service recommendation means the workflow resources such as data, procedures, tools and users, which are satisfied with the workflow goal, are recommendated to migrating instances by work places. If workflow resource services are limited, the workflow speed will be affected or stagnated. Aiming at the question which resource service is insufficient in single work place, this thesis provided a method of the resource service recommendation based on muliti-service agents for goal-oriented migrating workflows. In order to realize resource services were shared between members, we studied the member discovery and the group organization's communication protocol. The experiment indicated that the communication protocol enhanced resource service recommendation efficiency and reliability effectively.
4. A profit allocation method of multi-service agents for goal-oriented migrating workflows.
Active service based on the business acquaintance is one kind of multiagent union to active service essentially in migrating workflows. In order to guarantee the stable cooperationIn between the multiagents, this thesis studied the stratgy of multi-service agents profit allocation. The basic idea of this stratgy is that multi-service agents allocate profit for a business service net is formulated as a dynamic cooperative game. Though finding Markov perfect equilibrium solution of the dynamic cooperative game, corresponding compensation was computed. Using this compensation information, a profit allocation algorithm was designed. The results of the experiments showed that the profit allocation algorithm could achieve a multi-win Pareto-Optimal outcome, which makes active service tending to be more stable.
The main innovative contributions of this thesis are:
1. Aiming at the question of insufficient active service ability of single work place, a conformation method of active service environment based on the business acquaintance domain for goal-oriented migrating workflows was proposed.
The service acquaintance domain is a goal-oriened member subset of workflow alliance, which is builted and evolved according to the "small world" nature. Service acquaintance network which are interconnected by the service acquaintance domains cover all members and services of workflow alliance. Service acquaintance network may guarantee that the migrating instance has the dynamic work environment which the goal may reach. Compares with the single work place environment, service acquaintance domain not only has stronger multiagent union service ability, but also enhances the efficiency of workflows.
2. Aiming at the question that service agent of business acquaintance domain has part workflow view, a service navigation method in partially observable environment for migrating workflows was proposed.
In the goal-oriented workflow model, the workflow view of service acquaintance domain is the navigation agent can only observe partial workflow view, which is called as partially observe environment. Comparing with service navigation model and the algorithm based on the overall workflow view, the navigation method in partially observe environment could not only reduce the design difficulty of the multi-organizations and the large-scale workflow management system effectively, but also enhance the efficiency of workflows.
3. Aiming at the question of the cooperative stability of service acquaintance domain, a strategy of multi-service agents profit allocation for goal-oriented migrating workflows was proposed.
Service agents in the service acquaintance domain are rational workflow participants. They are pay attention to their profit while pursuing the workflow global goal. Therefore, the reasonable profit allocation is a foundation to maintain the service acquaintance domain stable. Comparing with the existing research results, this thesis proposed the strategy of multi-service agents profit allocation based on the dynamic cooperation game, which had made up the existing strategy. The strategy realized the optimized profit assignment among service agents and keeped the cooperation stability of service acquaintance domain
The author proposes the following future works: The service acquaintance network's evolved strategy will be established to support unusual processes and breakdown restores, which enhances the accessibility and the reliability of migrating workflows. Build a method of navigation cable based on service acquaintance domain to eliminate the recommendation difference between navigaition goal and method, which will improve the toughness and the efficiency of service navigation.
为了克服面向过程的迁移工作流方法的不足,在面向目标的迁移工作流模型中,迁移实例携带工作流目标说明书工作。工作流目标既可以通过迁移实例自身的服务发现实现,也可以通过工作位置的服务推荐实现(本文称工作位置对迁移实例的工作位置导航和工作流资源推荐为迁移工作流主动服务)。当工作流目标可以分解为多个业务子目标时,对于并行的业务子目标,不同的迁移实例可以在不同的工作位置上生成并首先在该工作位置运行。因为面向目标的迁移工作流可以大大提高迁移实例对工作环境动态变化的适应性,因此特别适合那些活动及其转移规则难于完全定义的跨机构业务过程。
本文针对单工作位置环境上主动服务能力不足的问题,在国家自然科学基金项目的资助下,以曾广周教授提出的迁移工作流系统框架为基础,研究了一类面向目标的迁移工作流主动服务方法,包括:基于业务熟人域的迁移工作流主动服务环境构建方法,业务熟人域上面向目标的迁移实例导航服务方法,业务熟人域上面向目标的迁移工作流资源服务推荐方法,业务熟人域上多服务主体收益分配方法,并通过实验对研究成果进行了验证和分析。
本文的主要工作包括:
1.面向目标的迁移工作流主动服务环境构建方法研究。
针对单工作位置环境上主动服务能力不足的问题,本文借鉴人类社会中的“小世界现象”,提出了一种基于业务熟人域的迁移工作流主动服务环境构建方法。方法的基本思想是:首先依据成员合作关系的类型和性质,将工作流联盟上的成员划分为面向目标的“小世界”(称为业务熟人域)集合;然后通过业务熟人域之间的成员合作关系,将工作流联盟上的成员集合映射为一个业务熟人网络,该业务熟人网络即为面向目标的迁移工作流主动服务环境。文中重点讨论了业务熟人域的可构造性质,给出了业务熟人域的构造算法和演化策略。实验表明,基于业务熟人域为迁移实例提供主动服务,较之单工作位置服务有更高的服务能力。
2.面向目标的迁移工作流服务导航方法研究。
在面向目标的迁移工作流模型中,服务导航是指当前工作位置向迁移实例推荐下一个合适的工作位置,工作位置上的导航主体既可以有全局工作流视图,也可以没有全局工作流视图。本文只研究导航主体缺少全局工作流视图的情况,因此,对服务导航方法的最低要求是不能造成迁移实例迷航而使迁移工作流中断。针对业务熟人域上导航主体缺少全局工作流视图的问题,本文视业务熟人域为当前导航主体部分可观测的工作流环境,采用POMDP方法,提出了一种基于业务熟人域的服务导航模型,定义了目标关联策略描述规范,给出了服务导航索的生成算法和目标驱动的服务导航算法。实验表明,基于业务熟人网进行服务导航,可以有效避免迁移实例迷航,并具有较高的导航效率和导航可靠性。
3.面向目标的迁移工作流资源服务推荐方法研究。
在面向目标的迁移工作流模型中,工作流资源服务推荐是指王作位置向迁移实例推荐那些能够满足工作流目标的数据、程序、工具和用户,以帮助迁移实例高效地完成那些需要在本地执行的任务。如果工作位置上的工作流资源服务能力受限,轻则会影响工作流进程的速度,重则会造成工作流进程停滞。针对单工作位置上资源服务能力不足的问题,本文建立了一种基于业务熟人域的多主体工作流资源服务推荐方法。为了快速实现成员间的资源服务分担,本文重点研究了成员发现和群组织中的通信协议问题。实验表明,本文建立的通信协议,可以有效提高基于业务熟人域的多主体资源服务推荐效率,具有很好的服务可靠性。
4.面向目标的迁移工作流多服务主体收益分配方法研究。
业务熟人域上的迁移工作流主动服务,本质上是一种多主体联合主动服务。为了保证多主体之间的稳定合作,本文针对现有研究成果中收益分配策略对收益补偿评估的不足,提出了一种基于动态合作博弈的多主体收益分配策略。策略的基本思想是:将多主体收益分配问题形式化为一个多人动态合作博弈,通过寻求动态合作博弈中马尔可夫完美均衡计算多主体的收益补偿,并利用补偿协调多服务主体最优收益分配。文中定义了多主体共识原则,给出了业务熟人域上的收益分配算法。实验表明,本文提出的收益分配策略能够使多服务主体根据最优共识原则,分配各方的合作收益,从而达到多赢的帕累托最优局面。
本文工作的创新点主要体现在:
1.针对单工作位置环境主动服务能力不足的问题,提出了一种基于业务熟人域的迁移工作流主动服务环境模型。
业务熟人域是工作流联盟成员集合上面向服务目标的成员子集,其“小世界”性质使得业务熟人域容易构造和演化。由业务熟人域互连而成的业务熟人网络,覆盖工作流联盟上的所有成员和服务,因而可以保证迁移实例有一个目标可达的动态工作环境。与单工作位置环境相比,业务熟人域上不仅蕴含了更强的多主体联合服务能力,而且可以使迁移实例在同一个业务熟人域上就近尽可能地完成多个工作流子目标,从而提高执行效率。
2.针对业务熟人域上服务主体缺少全局工作流视图的问题,提出了一种部分可观测环境下的迁移工作流服务导航方法。
在面向目标的迁移工作流模型中,业务熟人域上的工作流视图是导航主体唯一可见的局部工作流视图,或称作导航主体部分可观测的迁移工作流环境。与基于全局工作流视图的服务导航模型和算法相比,本文建立的部分可观测环境下的迁移工作流服务导航方法,不仅可以使工作流设计者摆脱全局工作流视图难以完善定义的困境,而且能够使迁移实例尽可能地在业务熟人域上迁移和就地工作,因而既可以有效规避迷航风险,也可以提高工作流效率。
3.针对业务熟人域上的合作稳定性问题,提出了基于动态合作博弈的多主体收益分配策略。
业务熟人域上的服务主体都是理性的工作流参与者,他们在追求工作流全局目标的同时,必定关注自己的收益,因此,合理的收益分配是保持业务熟人域稳定的基础。与现有研究成果中的收益分配策略相比,本文提出的基于动态合作博弈的多主体收益分配策略,弥补了现有策略对收益补偿评估的不足,实现了服务主体收益的最优化分配,因而有利于保持业务熟人域上的合作稳定性。
本文进一步的工作包括:建立业务熟人网络的演化策略,用以支持主动服务异常的处理与故障恢复,提高迁移工作流的可达性和可靠性;建立业务熟人域上协同导航索的趋同性生成方法,用以消除多导航主体之间存在的导航意图和导航方法差异,提高业务熟人域上联合服务导航的健壮性和效率。
Migrating workflow is an emerging technology that applies the mobile-agent computing paradigm to workflow management. Different from the traditional workflow model, migrating workflow is a process in which one or more migrating instances migrate continuously and utilize local workflow service to execute their tasks. Migrating instance is a performing agent of tasks. Work place is mapped to the network node, which is one of workflow participants. The set of all work places is called as migrating workflow environment in the workflow alliance, which is called the single work place environment in this thesis. Research in the field of process-oriented migrating workflows has primarily focused on workflow specifications. However, inherent structurized attributes in workflow specifications will limit the flexibility of migrating instances to solve questions inevitably, and reduce the compatibility to the dynamic environment.
In order to overcome the shortage of workflow process-oriented approach, migrating instances run with workflow specifications in the goal-oriented migrating workflow. The migrating workflow goal is realized by migrating instace's service discovery or work place's service recommendation (Migrating instances are recommend with work place and workflow resource is called migrating workflow active service in this thesis). A complex business goal is composed by a number of sub-goals. For different business processes goals, different migrating instances generat and run in the work place. Therefore, goal-oriented migrating workflow improves workflow system's flexibility to adapt to dynamic environment, especially for the concurrent distributed business processes.
This study was mainly supported by the National Natural Science Foundation of China under Grant and based on the migrating workflow framework proposed by professor ZENG This thesis focused on the methods of goal-oriented migrating workflow active service: a conformation method of the goal-oriented migrating workflow service environment based on business acquaintance domain, a migrating instance service navigation method for goal-oriented migrating workflow, a resource service recommendation method for goal-oriented migrating workflow and a profit allocation method of multi-service-agent for goal-oriented migrating workflow. The study has also built experiments to validate the conclusions.
The main contributions of this thesis are described as follows:
1. A conformation method of active service environment for goal-oriented migrating workflows.
Aiming at the question of insufficient active service ability of single "work place, this thesis borrowed the "small world phenomenon" of the social groups and provided the method of constructing the active service environment for workflows. The basic idea of this method is: Firstly, based on the member cooperation's type and the nature, members of migrating workflow will be divide into the goal-oriented "small world"sets (called service acquaintance domain); Then through the members of service acquaintance domains cooperating, the workflow member sets will be mapped as a service acquaintance network, which is called as active service environment for goal-oriented migrating workflow. In this thesis, we discussed the nature of service acquaintance domain, gave the strategy of construction and evolvement of acquaintance domain. Moreover, the experiments indicated that the active service based on the business acquaintance domain has the higher service ability than sigle work place.
2. A service navigation method for goal-oriented migrating workflows.
Service navigation means the current work place recommend the next work place for migrating instance. The navigation agent in the work place has a full or part workflow view. This thesis only studied on the navigation agent lacking of full workflow view. In order to meet the rich of services for the goal-oriented migrating workflow, we established POMDP method. This thesis proposed a service navigation model with the business acquaintance mechanism in partially observable environment, analysed service actors to meet the users, gave a service navigation strategy and proposed the arithmetic to build a service navigation cable. The experiment indicated that the sevice navigation based on service acquaintance domain did not enable migrating instance to get lost.
3. A resource service recommendation method for goal-oriented migrating workflows.
In goal-oriented migrating workflows model, resource service recommendation means the workflow resources such as data, procedures, tools and users, which are satisfied with the workflow goal, are recommendated to migrating instances by work places. If workflow resource services are limited, the workflow speed will be affected or stagnated. Aiming at the question which resource service is insufficient in single work place, this thesis provided a method of the resource service recommendation based on muliti-service agents for goal-oriented migrating workflows. In order to realize resource services were shared between members, we studied the member discovery and the group organization's communication protocol. The experiment indicated that the communication protocol enhanced resource service recommendation efficiency and reliability effectively.
4. A profit allocation method of multi-service agents for goal-oriented migrating workflows.
Active service based on the business acquaintance is one kind of multiagent union to active service essentially in migrating workflows. In order to guarantee the stable cooperationIn between the multiagents, this thesis studied the stratgy of multi-service agents profit allocation. The basic idea of this stratgy is that multi-service agents allocate profit for a business service net is formulated as a dynamic cooperative game. Though finding Markov perfect equilibrium solution of the dynamic cooperative game, corresponding compensation was computed. Using this compensation information, a profit allocation algorithm was designed. The results of the experiments showed that the profit allocation algorithm could achieve a multi-win Pareto-Optimal outcome, which makes active service tending to be more stable.
The main innovative contributions of this thesis are:
1. Aiming at the question of insufficient active service ability of single work place, a conformation method of active service environment based on the business acquaintance domain for goal-oriented migrating workflows was proposed.
The service acquaintance domain is a goal-oriened member subset of workflow alliance, which is builted and evolved according to the "small world" nature. Service acquaintance network which are interconnected by the service acquaintance domains cover all members and services of workflow alliance. Service acquaintance network may guarantee that the migrating instance has the dynamic work environment which the goal may reach. Compares with the single work place environment, service acquaintance domain not only has stronger multiagent union service ability, but also enhances the efficiency of workflows.
2. Aiming at the question that service agent of business acquaintance domain has part workflow view, a service navigation method in partially observable environment for migrating workflows was proposed.
In the goal-oriented workflow model, the workflow view of service acquaintance domain is the navigation agent can only observe partial workflow view, which is called as partially observe environment. Comparing with service navigation model and the algorithm based on the overall workflow view, the navigation method in partially observe environment could not only reduce the design difficulty of the multi-organizations and the large-scale workflow management system effectively, but also enhance the efficiency of workflows.
3. Aiming at the question of the cooperative stability of service acquaintance domain, a strategy of multi-service agents profit allocation for goal-oriented migrating workflows was proposed.
Service agents in the service acquaintance domain are rational workflow participants. They are pay attention to their profit while pursuing the workflow global goal. Therefore, the reasonable profit allocation is a foundation to maintain the service acquaintance domain stable. Comparing with the existing research results, this thesis proposed the strategy of multi-service agents profit allocation based on the dynamic cooperation game, which had made up the existing strategy. The strategy realized the optimized profit assignment among service agents and keeped the cooperation stability of service acquaintance domain
The author proposes the following future works: The service acquaintance network's evolved strategy will be established to support unusual processes and breakdown restores, which enhances the accessibility and the reliability of migrating workflows. Build a method of navigation cable based on service acquaintance domain to eliminate the recommendation difference between navigaition goal and method, which will improve the toughness and the efficiency of service navigation.
引文
[1]Cruz S M,Chirigati F S,Dahis R,et al.Using Explicit Control Processes in Distributed Workflows to Gather Provenance[C].Second International Provenance and Annotation Workshop.2008:186-199.
[2]Zhuge H.Workflow and agent-based cognitive flow management for distributed team cooperation[J].Inf.Manage.2003,40(5):419-429.
[3]De R D,Goble C,Stevens R.The design and realisation of the Experiment Virtual Research Environment for Social Sharing of Workflows[J].Future Generation Computer Systems.2009,25(5):561-567.
[4]Xuan P,Lesser V.Multi-agent policies:from centralized ones to decentralized ones[C].Proceedings of the First International Joint Conference on Autonomous Agents and Multi Agent Systems.2002:1098-1105.
[5]史美林,杨光信,向勇,et al.WfMS:工作流管理系统[J].计算机学报.1999,22(3):325-334.
[6]潘炎,汤庸,陈子聪.一种工作流模型的时间性能评估方法[J].计算机集成制造系统.2007,8(13):198-205.
[7]Wang J,Rosca D.Dynamic Workflow Modeling and Verification[J].Lecture Notes in Computer Science.2006,4(1):303-311.
[8]Ando Y,Tsukamoto N,Kawaguchi O,et al.What does Workflow Analysis bring the Information System in the Radiotherapy Department? Seamless Communication Proposed by Japanese IHE-RO[J].International Journal of Radiation Oncology,Biology,Physics.2008,72(1S):668-669.
[9]范玉顺,吴澄.一种提高系统柔性的工作流建模方法研究[J].软件学报.2002,13(4):833-839.
[10]Georgakopoulos D,Hornick M,Sheth A.An overview of workflow management:From process modeling to workflow automation infrastructure[J].Distributed and Parallel Databases.1995,3(2):119-153.
[11]Jennings N R,Norman T J,Faratin P,et al.Autonomous Agents for Business Process Management[J].International Journal of Applied Artificial Intelligence.2000,14(2):145-189.
[12] Kumar A. XML-Based Schema Definition for Support of Interorganizational Workflow[J], Information Systems Research. 2003, 14(1): 23-46.
[13] Merz M. Using Mobile Agents to Support Interorganizational Workflow Management[J]. Applied Artificial Intelligence. 1997, 11(6): 551-572.
[14] Feng Y, Cai W. Provenance Provisioning in Mobile Agent-Based Distributed Job Workflow Execution[J]. Lecture Notes in Computer Science. 2007, 4(7):398-405.
[15] Jami S I, Shaikh Z A. A workflow based academic management system using multi agent approach[C]. Proceedings of the 11th WSEAS International Conference on Computers table of contents. 2007:234-245.
[16] Fang G M, Hong Z W, Lin J M. A Scripting Approach for Workflow of Agents[C]. Proceedings of the 22nd International Conference on Advanced Information Networking and Applications. 2008:1049-1053.
[17] Pinheiro W A, Vivacqua A S, Barros R, et al. Dynamic Workflow Management for P2P Environments Using Agents[J]. Lecture Notes in Computer Science. 2007,4(9): 253-261.
[18] Lin D, Sheng H, Ishida T. Interorganizational Workflow Execution Based on Process Agents and ECA Rules[J]. Transactions on Information and Systems. 2007,90(9): 13-35.
[19] Karpowitz D J, Cox J J, Humpherys J C, et al. A dynamic workflow framework for mass customization using web service and autonomous agent techniques[J].Journal of Intelligent Manufacturing. 2008, 19(5): 537-552.
[20] Robinson W N . Goal-Oriented Workflow Analysis and Infrastructure[R]. NSF Workshop on Workflow & Process Automation. 1996.
[21] Paul A B, Jos M V. Towards Adaptive Workflow Enactment Using Multi agent Systems[J]. Information Technology and Management. 2005, 6(1): 61-87.
[22] Korhonen J, Pajunen L, Puustjarvi J. Automatic composition of Web service workflows using a semantic agent[C]. International Conference on Web Intelligence.2003: 566-569.
[23] Cardoso J, Sheth A, Miller J, et al. Quality of Service for Workflows and Web Service Processes[J]. Journal of Web Semantics. 2004, 1(3): 281-308.
[24] Cavalcanti M C, Targino R, Bai F, et al. Managing structural genomic workflows using web services[J]. Data & Knowledge Engineering. 2005, 53(1):45-74.
[25]Lud B,Altintas I,Gupta A.Compiling abstract scientific workflows into web service workflows 15th Intl.Conference on Scientific and Statistical Database Management[C].2003.
[26]Chappell D.Enterprise service bus[M].O'Reilly Media,Inc.,2004.
[27]范玉顺.工作流管理技术基础-实现企业业务过程重组、过程管理与业务过程自动化的核心技术[M].北京:清华大学出版社,2001.
[28]Hollingsworth D.Workflow Management Coalition the Workflow Reference Model[J].the Workflow Management Coalition.1995,12(1):22-32.
[29]Workflow Management Coalition.Workftow Management Coalition Terminology & Glossary WFMC-TC-1011,Workflow Management Coalition 1996.
[30]Deelman E,Gannon D,Shields M,et al.Workflows and e-science:An overview of workflow system features and capabilities[J].Future Generation Computer Systems.2009,25(5):528-540.
[31]Glatard T,Montagnat J,Lingrand D,et al.Flexible and efficient workflow deployment of data-intensive applications on grids with MOTEUR[J].International Journal of High Performance Computing Applications.2008,22(3):347-352.
[32]Wang Y.A relation-based workflow model for planning management system[C].Proceedings of 2008 IEEE International Conference on Service Operations and Logistics,and Informatics.2008:12-15.
[33]Bieszczad A,Pagurek B,White T.Mobile agents for network management[J].IEEE Communications Surveys.1998,1(1):2-9.
[34]Bellavista P,Corradi A,Stefanelli C.Mobile agent middleware for mobile computing[J].Computer.2001,34(3):73-81.
[35]Gray R S,Cybenko G,Kotz D,et al.D'Agents:applications and performance of a mobile-agent system[J].Software:Practice and Experience.2002,32(6):543-573.
[36]Shi H,Wang L,Chu T.Virtual leader approach to coordinated control of multiple mobile agents with asymmetric interactions[J].Physica D:Nonlinear Phenomena.2006,213(1):51-65.
[37]Cichocki A,Rusinkiewicz M.Providing Transactional Properties for Migrating Workflows[J].Mobile Networks and Applications.2004,9(5):473-480.
[38]曾广周,党妍.基于移动计算范型的迁移工作流研究[J].计算机学报.2003,26(10):1343-1349.
[39]Browne E,Schrefl M.A Two Tier,Goal-Driven Workflow Model For The Healthcare Domain[C].5th International Conference on Enterprise Information Systems.2003:125-133.
[40]Stepp R E,Michalski R S.Conceptual clustering of structured objects;a goal-oriented approach[J].Artificial Intelligence.1986,28(1):43-69.
[41]Ezawa K J,Singh M,Norton S W.Learning Goal Oriented Bayesian Networks for Telecommunications Risk Management[C].Machine learning:proceedings of the Thirteenth International Conference.1996:139-145.
[42]Lamsweerde A.Goal-Oriented Requirements Engineering:A Guided Tour[C].Proceedings of the 5th IEEE International Symposium on Requirements Engineering.2001:263-268.
[43]Mylopoulos J,Chung L,Yu F.From object-oriented to goal-oriented requirements analysis[J].Communaction.1999,42(1):31-37.
[44]Huth C,Smolnik S,Nastansky L.Applying topic maps to ad hoc workflows for semantic associative navigation in process networks[C].Proceedings of the Seventh International Workshop on Groupware.2001:44-49.
[45]史忠植.智能主体及其应用[M].北京:科学出版社,2000.
[46]杨公平,曾广周,卢朝霞.迁移工作流系统中停靠站服务器的设计与实现[J].计算机工程与应用.2004,40(019):111-112.
[47]曾广周,杨公平,王晓琳.基于Agent能力自信度的任务分配问题研究[J].计算机学报.2007,30(11):1922-1929.
[48]Liu F,Zeng G.Study of genetic algorithm with reinforcement learning to solve the TSP[J].Expert Systems With Applications.2009,36(3):6995-7001.
[49]Wu X,Zeng G,Yang G.A Novel Approach for Describing Goals with DLs in Intelligent Agents[C].Fourth International Conference on Natural Computation 2008:45-49.
[50]刘菲,曾广周.迁移工作流系统中本体替换的柔性机制[J].小型微型计算机系统.2007,28(09):1641-1646.
[51]秦宇锋,曾广周.迁移工作流系统中位置服务体系结构的研究与设计[J].计算机应用.2007,27(10):2595-2597.
[52]王红,曾广周.无线迁移工作流按需移动中停靠站缓存管理机制[J].计算机工程与应用.2007,43(029):30-35.
[53]王红,曾广周,刘弘.无线迁移工作流环境中程序按需移动[J].计算机应用.2007,27(011):2728-2732.
[54]周晓林,曾广周.一种基于P2P的工作流管理系统设计[J].山东大学学报.2007,37(005):89-94.
[55]吴修国,曾广周,许崇敬.基于描述逻辑的目标推理研究[J].计算机科学.2008,35(7):142-144.
[56]吴修国,曾广周,韩芳溪,et al.迁移工作流中的目标规划研究[J].计算机科学.2008,35(1):147-150.
[57]张凤芝,曾广周.支持移动用户的迁移工作流服务中间件设计[J].计算机系统应用.2008,17(5):39-42.
[58]Bichler M,Lin K J.Service-Oriented Computing[J].Computer.2006,39(3):99-101.
[59]Papazoglou M P,den Van H.Service-oriented design and development methodology[J].International Journal of Web Engineering and Technology.2006,2(4):412-442.
[60]Papazoglou M P.Web Services:Principles and Technology[M].Pearson Prentice Hall,2008.
[61]Jacobs I,Walsh N.Architecture of the World Wide Web[J].World Wide Web Consortium.2004,12(15):27-34.
[62]Roy J,Ramanujan A.Understanding Web Services[J].IT Professional.2001,3(6) 69-73.
[63]]Newcomer E.Understanding Web Services:XML,Wsdl,Soap,and UDDI[M].Addison-Wesley Professional,2002.
[64]Apte N,Mehta T.UDDI:building registry-based web services solutions[M].Pearson Education,2003.
[65]Curbera F,Duftler M,Khalaf R,et al.Unraveling the Web services web:an introduction to SOAP,WSDL,and UDDI[J].IEEE Internet computing.2002:86-93.
[66]Khalaf R,Mukhi N,Weerawarana S.Service-Oriented Composition in BPEL4WS[C].Proceedings of the Twelfth International Conference on World Wide Web(WWW).2003:768-774.
[67]Huhns M N,Singh M P.Service-Oriented Computing:Key Concepts and Principles[J].IEEE Internet Computing.2005,9(1):75-81.
[68]李厚福,韩燕波,虎嵩林,et al.一种面向服务事件驱动的企业应用动态联盟构造方法[J].计算机学报.2005,28(4):739-749.
[69]Baldoni M,Baroglio C,Martelli A,et al.Reasoning about interaction protocols for customizing web service selection and composition[J].Journal of Logic and Algebraic Programming.2007,70(1):53-73.
[70]Cook W R,Barfield J.Web Service versus Distributed Objects:A Case Study of Performance and Interface Design[J].International Journal of Web Services Research.2007,4(3):49-64.
[71]Krafzig D,Banke K,Slama D.Enterprise SOA:Service-Oriented Architecture Best Practices[M].Prentice Hall Ptr,2004.
[72]Erl T.Soa:principles of service design[M].Prentice Hall PTR.2007.
[73]Schroth C,Janner T.Web 2.0 and SOA:Converging Concepts Enabling the Internet of Services[J].IT PROFESSIONAL.2007,2(12):36-41.
[74]张尧学,方存好.主动服务[M].科学出版社,2005.
[75]Chuang S N,Chan A T.Active Service for Mobile Middleware[J].World Wide Web.2005,8(2):127-157.
[76]Marshall I W,Roadknight C.Adaptive Management of an Active Service Network[J].BT Technology Journal.2000,18(4):78-84.
[77]Bai X,Lee S,Tsai W T,et al.Collaborative web services monitoring with active service broker[J].Computer Software and Applications.2008,22(11):84-91.
[78]Han J,Han Y,Jin Y,et al.Personalized Active Service Spaces for End-User Service Composition[C].IEEE International Conference on Services Computing,2006:198-205.
[79]Watts D J,Strogatz S H.Collective dynamics of 'small-world' networks[J].Nature.1998,393(6684):440-442.
[80]Castellani S,Andreoli J M,Bratu M,et al.E-alliance:A negotiation infrastructure for virtual alliances[J].Group Decision and Negotiation.2003,12(2):127-141.
[81]Bengtsson M,Kock S."Coopetition" in Business Networks to Cooperate and Compete Simultaneously[J].Industrial Marketing Management.2000,29(5):411-426.
[82]Li S X,Huang Z,Zhu J,et al.Cooperative advertising,game theory and manufacturer-retailer supply chains[J].Omega.2002,30(5):347-357.
[83]Reddy M C,Dourish P,Pratt W.Coordinating heterogeneous work:Information and representation in medical care[C].Kluwer Academic Publishers,2001,258.
[84]Castellano M,Pastore N,Arcieri F,et al.An e-government cooperative framework for government agencies[C].Proceedings of the Proceedings of the 38th Annual Hawaii International Conference on System Sciences,2005,121-123.
[85]Kowalczyk R,Braun P,Mueller I,et al.Deploying mobile and intelligent agents in interconnected e-marketplaces[J].Journal of Integrated Design and Process Science.2003,7(3):109-123.
[86]Russell S J,Norvig P,Canny J F,et al.Artificial intelligence:a modern approach[M].Prentice hall Englewood Cliffs,1995.
[87]Weiss G.Multiagent systems:a modern approach to distributed artificial intelligence[M].The MIT Press,2000.
[88]赵欣培,李明树,王青,et al.一种基于Agent的自适应软件过程模型[J].软件学报.2004,15(003):348-359.
[89]蒋建国,张国富,夏娜,et al.一种基于理性Agent的任务求解联盟形成策略[J].自动化学报.2008,34(004):478-481.
[90]王黎明,黄厚宽.基于主Agent信念修正的推测计算及其资源协商[J].软件学报.2005,16(11):1920-1928.
[91]Bernstein D S,Givan R,Immerman N,et al.The complexity of decentralized control of Markov decision processes[J].Mathematics of operations research.2002,27(4):819-840.
[92]Filar J A,Vrieze K,Vrieze O J.Competitive Markov decision processes[M].Springer Verlag,1997.
[93]胡奇英,刘建庸.马尔可夫决策过程引论[M].西安电子科技大学出版社,2000.
[94]李响,陈小平.一种动态不确定性环境中的持续规划系统[J].计算机学报.2005,28(007):1163-1170.
[95]仵博,吴敏.部分可观察马尔可夫决策过程研究进展[J].计算机工程与设计.2007,28(009):2116-2119.
[96]Zhao W,Tong L,Swami A,et al.Decentralized cognitive MAC for opportunistic spectrum access in ad hoc networks:A POMDP framework[J].IEEE Journal on Selected Areas in Communications.2007,25(3):589-597.
[97]Poupart P,Boutilier C.Value-directed compression of POMDPs[J].Advances in Neural Information Processing Systems.2003,22(2):1579-1586.
[98]Pineau J,Gordon G,Thrun S.Point-based value iteration:An anytime algorithm for POMDPs[C].The International Joint Conference on Artificial Intelligence.2003:1025-1030.
[99]Roy N,Gordon G,Thrun S.Finding approximate POMDP solutions through belief compression[J].Journal of Artificial Intelligence Research.2005,2(3):1-40.
[100]杨公平,曾广周.基于导航的迁移工作流组织与执行[J].吉林大学学报.2006,36(5):819-823.
[101]Resnick P,Varian H R.Recommender systems[J].Communications of the ACM.1997,40(3):56-58.
[102]Felfernig A,Friedrich G,Schmidt-thieme L.Recommender Systems[J].IEEE Intelligent Systems.2007,22(3):18-26.
[103]Tintarev N,Masthoff J.A Survey of Explanations in Recommender Systems[C].IEEE 23rd International Conference on Data Engineering Workshop.2007:801-810.
[104]Cho Y H,Kim J K,Kim S H.A personalized recommender system based on web usage mining and decision tree induction[J].Expert Systems With Applications.2002,23(3):329-342.
[105]Pazzani M J,Billsus D.Content-Based Recommendation Systems[J].Lecture Notes in Computer Science.2007,4(1):325-336.
[106]Goldberg D,Nichols D,Oki B M,et al.Using collaborative filtering to weave an information tapestry[J].Communications of the ACM.1992,35(12):61-70.
[107]Cho Y H,Kim J K.Application of Web usage mining and product taxonomy to collaborative recommendations in e-commerce[J].Expert Systems With Applications.2004,26(2):233-246.
[108]Balabanovi M,Shoham Y.Fab:content-based,collaborative recommendation[J].Communications of the ACM 1997,40(3):66-72.
[109]Cardoso J,Netlibrary I.Semantic Web Services:Theory,Tools and Applications[M].Information Science Reference,2007.
[110]Roman D,Lausen H,Keller U,De B J,Bussler C,Domingue J,Fensel D,Hepp M,Kifer M,K R B.D2v1.2.Web Service Modeling Ontology(WSMO)[R].Cambridge:W3C,2005.
[111]Feeley M,Hutchinson N,Ray S.Realistic Mobility for Mobile Ad Hoc Network Simulation[J].Lecture notes in computer science.2004:324-329.
[112]Kato T,Ono M,Higaki H.Parallelization of GloMoSim Wireless Network Simulator[R].IPSJ SIG Technical Reports.2006,(121):55-58.
[113]Lee S J,Su W,Gerla M.On-demand multicast routing protocol in multihop wireless mobile networks[J].Mobile Networks and Applications.2002,7(6):441-453.
[114]Bae S H,Lee S J,Su W,et al.The design,implementation,and performance evaluation of the on-demand multicast routing protocol in multihop wireless networks[J].Network.2000,14(1):70-77.
[115]赵纯均,陈剑.虚拟企业及其构建研究[J].系统工程理论与实践.2002,22(1):49-55.
[116]张维迎.博弈论与信息经济学[M].上海人民出版社,2004.
[117]黄涛.博弈论教程--理论 应用[M].北京:首都经济贸易大学出版社,2004.
[118]Nash J F.Equilibrium points in n-person games[C].Proceeding of the National Academy of Sciences of the United States of America.1950:48-49.
[119]Gibbons R.A primer in game theory[M].Harvester Wheatsheaf,1994.
[120]Shapley L S,Shubik M.A method for evaluating the distribution of power in a committee system[J].The American Political Science Review.1954,2(1):787-792.
[121]Von N J,Morgenstem O.Theory of games and economic behavior[M].Princeton Univ Press,2004.
[122]Aumann R J,Maschler M.The bargaining set for cooperative games[J].Classics in Game Theory.1997,21(3):140-149.
[123]Lin Z.A new bargaining set of an n-person game and endogenous coalition formation[J].Games and Economic Behavior.1994,6(1):512-526.
[124]Davis M,Maschler M.The kernel of a cooperative game[J].Naval Research Logistics Quarterly.1965,12(3):223-259.
[125]Schmeidler D.The nucleolus of a characteristic function game[J].SIAM Journal on Applied Mathematics.1969,12(1):1163-1170.
[126]Curiel I J,Maschler M,Tijs S H.Bankruptcy games[J].Mathematical Methods of Operations Research.1987,31(5):143-159.
[127]Aumann R J.An axiomatization of the non-transferable utility value[J]. Econometrica: Journal of the Econometric Society. 1985,35(12): 599-612.
[128] Aumann R J. The core of a cooperative game without side payments[J].Transactions of the American Mathematical Society. 1961,23(2): 539-552.
[129] Aumann R J, Shapley L S, Aumann R J. Values of non-atomic games[M].Princeton University Press Princeton, 1974.
[130] Kirk D E. Optimal Control Theory: An Introduction[M]. Courier Dover Publications, 2004.
[131] Maskin E, Tirole J. Markov Perfect Equilibrium Observable actions[J]. Journal of Economic Theory. 2001, 100(2): 191-219.
[132] Ericson R, Pakes A. Markov-Perfect Industry Dynamics: A Framework for Empirical Work[J]. The Review of Economic Studies. 1995, 62(1): 53-82.
[133] Shorrocks A F. Decomposition Procedures for Distributional Analysis: A Unified Framework Based on the Shapley ValuefM]. University of Essex. 1999.
[134] Hsiao C R, Raghavan T E. The Shapley value for multi-choice cooperative games[D]. University of Illinois at Chicago, 1991.
[135] Jin M, Wu S D. Procurement auctions with supplier coalitions: validity requirements and mechanism design[R]. Lehigh University working paper, 2002.
[2]Zhuge H.Workflow and agent-based cognitive flow management for distributed team cooperation[J].Inf.Manage.2003,40(5):419-429.
[3]De R D,Goble C,Stevens R.The design and realisation of the Experiment Virtual Research Environment for Social Sharing of Workflows[J].Future Generation Computer Systems.2009,25(5):561-567.
[4]Xuan P,Lesser V.Multi-agent policies:from centralized ones to decentralized ones[C].Proceedings of the First International Joint Conference on Autonomous Agents and Multi Agent Systems.2002:1098-1105.
[5]史美林,杨光信,向勇,et al.WfMS:工作流管理系统[J].计算机学报.1999,22(3):325-334.
[6]潘炎,汤庸,陈子聪.一种工作流模型的时间性能评估方法[J].计算机集成制造系统.2007,8(13):198-205.
[7]Wang J,Rosca D.Dynamic Workflow Modeling and Verification[J].Lecture Notes in Computer Science.2006,4(1):303-311.
[8]Ando Y,Tsukamoto N,Kawaguchi O,et al.What does Workflow Analysis bring the Information System in the Radiotherapy Department? Seamless Communication Proposed by Japanese IHE-RO[J].International Journal of Radiation Oncology,Biology,Physics.2008,72(1S):668-669.
[9]范玉顺,吴澄.一种提高系统柔性的工作流建模方法研究[J].软件学报.2002,13(4):833-839.
[10]Georgakopoulos D,Hornick M,Sheth A.An overview of workflow management:From process modeling to workflow automation infrastructure[J].Distributed and Parallel Databases.1995,3(2):119-153.
[11]Jennings N R,Norman T J,Faratin P,et al.Autonomous Agents for Business Process Management[J].International Journal of Applied Artificial Intelligence.2000,14(2):145-189.
[12] Kumar A. XML-Based Schema Definition for Support of Interorganizational Workflow[J], Information Systems Research. 2003, 14(1): 23-46.
[13] Merz M. Using Mobile Agents to Support Interorganizational Workflow Management[J]. Applied Artificial Intelligence. 1997, 11(6): 551-572.
[14] Feng Y, Cai W. Provenance Provisioning in Mobile Agent-Based Distributed Job Workflow Execution[J]. Lecture Notes in Computer Science. 2007, 4(7):398-405.
[15] Jami S I, Shaikh Z A. A workflow based academic management system using multi agent approach[C]. Proceedings of the 11th WSEAS International Conference on Computers table of contents. 2007:234-245.
[16] Fang G M, Hong Z W, Lin J M. A Scripting Approach for Workflow of Agents[C]. Proceedings of the 22nd International Conference on Advanced Information Networking and Applications. 2008:1049-1053.
[17] Pinheiro W A, Vivacqua A S, Barros R, et al. Dynamic Workflow Management for P2P Environments Using Agents[J]. Lecture Notes in Computer Science. 2007,4(9): 253-261.
[18] Lin D, Sheng H, Ishida T. Interorganizational Workflow Execution Based on Process Agents and ECA Rules[J]. Transactions on Information and Systems. 2007,90(9): 13-35.
[19] Karpowitz D J, Cox J J, Humpherys J C, et al. A dynamic workflow framework for mass customization using web service and autonomous agent techniques[J].Journal of Intelligent Manufacturing. 2008, 19(5): 537-552.
[20] Robinson W N . Goal-Oriented Workflow Analysis and Infrastructure[R]. NSF Workshop on Workflow & Process Automation. 1996.
[21] Paul A B, Jos M V. Towards Adaptive Workflow Enactment Using Multi agent Systems[J]. Information Technology and Management. 2005, 6(1): 61-87.
[22] Korhonen J, Pajunen L, Puustjarvi J. Automatic composition of Web service workflows using a semantic agent[C]. International Conference on Web Intelligence.2003: 566-569.
[23] Cardoso J, Sheth A, Miller J, et al. Quality of Service for Workflows and Web Service Processes[J]. Journal of Web Semantics. 2004, 1(3): 281-308.
[24] Cavalcanti M C, Targino R, Bai F, et al. Managing structural genomic workflows using web services[J]. Data & Knowledge Engineering. 2005, 53(1):45-74.
[25]Lud B,Altintas I,Gupta A.Compiling abstract scientific workflows into web service workflows 15th Intl.Conference on Scientific and Statistical Database Management[C].2003.
[26]Chappell D.Enterprise service bus[M].O'Reilly Media,Inc.,2004.
[27]范玉顺.工作流管理技术基础-实现企业业务过程重组、过程管理与业务过程自动化的核心技术[M].北京:清华大学出版社,2001.
[28]Hollingsworth D.Workflow Management Coalition the Workflow Reference Model[J].the Workflow Management Coalition.1995,12(1):22-32.
[29]Workflow Management Coalition.Workftow Management Coalition Terminology & Glossary WFMC-TC-1011,Workflow Management Coalition 1996.
[30]Deelman E,Gannon D,Shields M,et al.Workflows and e-science:An overview of workflow system features and capabilities[J].Future Generation Computer Systems.2009,25(5):528-540.
[31]Glatard T,Montagnat J,Lingrand D,et al.Flexible and efficient workflow deployment of data-intensive applications on grids with MOTEUR[J].International Journal of High Performance Computing Applications.2008,22(3):347-352.
[32]Wang Y.A relation-based workflow model for planning management system[C].Proceedings of 2008 IEEE International Conference on Service Operations and Logistics,and Informatics.2008:12-15.
[33]Bieszczad A,Pagurek B,White T.Mobile agents for network management[J].IEEE Communications Surveys.1998,1(1):2-9.
[34]Bellavista P,Corradi A,Stefanelli C.Mobile agent middleware for mobile computing[J].Computer.2001,34(3):73-81.
[35]Gray R S,Cybenko G,Kotz D,et al.D'Agents:applications and performance of a mobile-agent system[J].Software:Practice and Experience.2002,32(6):543-573.
[36]Shi H,Wang L,Chu T.Virtual leader approach to coordinated control of multiple mobile agents with asymmetric interactions[J].Physica D:Nonlinear Phenomena.2006,213(1):51-65.
[37]Cichocki A,Rusinkiewicz M.Providing Transactional Properties for Migrating Workflows[J].Mobile Networks and Applications.2004,9(5):473-480.
[38]曾广周,党妍.基于移动计算范型的迁移工作流研究[J].计算机学报.2003,26(10):1343-1349.
[39]Browne E,Schrefl M.A Two Tier,Goal-Driven Workflow Model For The Healthcare Domain[C].5th International Conference on Enterprise Information Systems.2003:125-133.
[40]Stepp R E,Michalski R S.Conceptual clustering of structured objects;a goal-oriented approach[J].Artificial Intelligence.1986,28(1):43-69.
[41]Ezawa K J,Singh M,Norton S W.Learning Goal Oriented Bayesian Networks for Telecommunications Risk Management[C].Machine learning:proceedings of the Thirteenth International Conference.1996:139-145.
[42]Lamsweerde A.Goal-Oriented Requirements Engineering:A Guided Tour[C].Proceedings of the 5th IEEE International Symposium on Requirements Engineering.2001:263-268.
[43]Mylopoulos J,Chung L,Yu F.From object-oriented to goal-oriented requirements analysis[J].Communaction.1999,42(1):31-37.
[44]Huth C,Smolnik S,Nastansky L.Applying topic maps to ad hoc workflows for semantic associative navigation in process networks[C].Proceedings of the Seventh International Workshop on Groupware.2001:44-49.
[45]史忠植.智能主体及其应用[M].北京:科学出版社,2000.
[46]杨公平,曾广周,卢朝霞.迁移工作流系统中停靠站服务器的设计与实现[J].计算机工程与应用.2004,40(019):111-112.
[47]曾广周,杨公平,王晓琳.基于Agent能力自信度的任务分配问题研究[J].计算机学报.2007,30(11):1922-1929.
[48]Liu F,Zeng G.Study of genetic algorithm with reinforcement learning to solve the TSP[J].Expert Systems With Applications.2009,36(3):6995-7001.
[49]Wu X,Zeng G,Yang G.A Novel Approach for Describing Goals with DLs in Intelligent Agents[C].Fourth International Conference on Natural Computation 2008:45-49.
[50]刘菲,曾广周.迁移工作流系统中本体替换的柔性机制[J].小型微型计算机系统.2007,28(09):1641-1646.
[51]秦宇锋,曾广周.迁移工作流系统中位置服务体系结构的研究与设计[J].计算机应用.2007,27(10):2595-2597.
[52]王红,曾广周.无线迁移工作流按需移动中停靠站缓存管理机制[J].计算机工程与应用.2007,43(029):30-35.
[53]王红,曾广周,刘弘.无线迁移工作流环境中程序按需移动[J].计算机应用.2007,27(011):2728-2732.
[54]周晓林,曾广周.一种基于P2P的工作流管理系统设计[J].山东大学学报.2007,37(005):89-94.
[55]吴修国,曾广周,许崇敬.基于描述逻辑的目标推理研究[J].计算机科学.2008,35(7):142-144.
[56]吴修国,曾广周,韩芳溪,et al.迁移工作流中的目标规划研究[J].计算机科学.2008,35(1):147-150.
[57]张凤芝,曾广周.支持移动用户的迁移工作流服务中间件设计[J].计算机系统应用.2008,17(5):39-42.
[58]Bichler M,Lin K J.Service-Oriented Computing[J].Computer.2006,39(3):99-101.
[59]Papazoglou M P,den Van H.Service-oriented design and development methodology[J].International Journal of Web Engineering and Technology.2006,2(4):412-442.
[60]Papazoglou M P.Web Services:Principles and Technology[M].Pearson Prentice Hall,2008.
[61]Jacobs I,Walsh N.Architecture of the World Wide Web[J].World Wide Web Consortium.2004,12(15):27-34.
[62]Roy J,Ramanujan A.Understanding Web Services[J].IT Professional.2001,3(6) 69-73.
[63]]Newcomer E.Understanding Web Services:XML,Wsdl,Soap,and UDDI[M].Addison-Wesley Professional,2002.
[64]Apte N,Mehta T.UDDI:building registry-based web services solutions[M].Pearson Education,2003.
[65]Curbera F,Duftler M,Khalaf R,et al.Unraveling the Web services web:an introduction to SOAP,WSDL,and UDDI[J].IEEE Internet computing.2002:86-93.
[66]Khalaf R,Mukhi N,Weerawarana S.Service-Oriented Composition in BPEL4WS[C].Proceedings of the Twelfth International Conference on World Wide Web(WWW).2003:768-774.
[67]Huhns M N,Singh M P.Service-Oriented Computing:Key Concepts and Principles[J].IEEE Internet Computing.2005,9(1):75-81.
[68]李厚福,韩燕波,虎嵩林,et al.一种面向服务事件驱动的企业应用动态联盟构造方法[J].计算机学报.2005,28(4):739-749.
[69]Baldoni M,Baroglio C,Martelli A,et al.Reasoning about interaction protocols for customizing web service selection and composition[J].Journal of Logic and Algebraic Programming.2007,70(1):53-73.
[70]Cook W R,Barfield J.Web Service versus Distributed Objects:A Case Study of Performance and Interface Design[J].International Journal of Web Services Research.2007,4(3):49-64.
[71]Krafzig D,Banke K,Slama D.Enterprise SOA:Service-Oriented Architecture Best Practices[M].Prentice Hall Ptr,2004.
[72]Erl T.Soa:principles of service design[M].Prentice Hall PTR.2007.
[73]Schroth C,Janner T.Web 2.0 and SOA:Converging Concepts Enabling the Internet of Services[J].IT PROFESSIONAL.2007,2(12):36-41.
[74]张尧学,方存好.主动服务[M].科学出版社,2005.
[75]Chuang S N,Chan A T.Active Service for Mobile Middleware[J].World Wide Web.2005,8(2):127-157.
[76]Marshall I W,Roadknight C.Adaptive Management of an Active Service Network[J].BT Technology Journal.2000,18(4):78-84.
[77]Bai X,Lee S,Tsai W T,et al.Collaborative web services monitoring with active service broker[J].Computer Software and Applications.2008,22(11):84-91.
[78]Han J,Han Y,Jin Y,et al.Personalized Active Service Spaces for End-User Service Composition[C].IEEE International Conference on Services Computing,2006:198-205.
[79]Watts D J,Strogatz S H.Collective dynamics of 'small-world' networks[J].Nature.1998,393(6684):440-442.
[80]Castellani S,Andreoli J M,Bratu M,et al.E-alliance:A negotiation infrastructure for virtual alliances[J].Group Decision and Negotiation.2003,12(2):127-141.
[81]Bengtsson M,Kock S."Coopetition" in Business Networks to Cooperate and Compete Simultaneously[J].Industrial Marketing Management.2000,29(5):411-426.
[82]Li S X,Huang Z,Zhu J,et al.Cooperative advertising,game theory and manufacturer-retailer supply chains[J].Omega.2002,30(5):347-357.
[83]Reddy M C,Dourish P,Pratt W.Coordinating heterogeneous work:Information and representation in medical care[C].Kluwer Academic Publishers,2001,258.
[84]Castellano M,Pastore N,Arcieri F,et al.An e-government cooperative framework for government agencies[C].Proceedings of the Proceedings of the 38th Annual Hawaii International Conference on System Sciences,2005,121-123.
[85]Kowalczyk R,Braun P,Mueller I,et al.Deploying mobile and intelligent agents in interconnected e-marketplaces[J].Journal of Integrated Design and Process Science.2003,7(3):109-123.
[86]Russell S J,Norvig P,Canny J F,et al.Artificial intelligence:a modern approach[M].Prentice hall Englewood Cliffs,1995.
[87]Weiss G.Multiagent systems:a modern approach to distributed artificial intelligence[M].The MIT Press,2000.
[88]赵欣培,李明树,王青,et al.一种基于Agent的自适应软件过程模型[J].软件学报.2004,15(003):348-359.
[89]蒋建国,张国富,夏娜,et al.一种基于理性Agent的任务求解联盟形成策略[J].自动化学报.2008,34(004):478-481.
[90]王黎明,黄厚宽.基于主Agent信念修正的推测计算及其资源协商[J].软件学报.2005,16(11):1920-1928.
[91]Bernstein D S,Givan R,Immerman N,et al.The complexity of decentralized control of Markov decision processes[J].Mathematics of operations research.2002,27(4):819-840.
[92]Filar J A,Vrieze K,Vrieze O J.Competitive Markov decision processes[M].Springer Verlag,1997.
[93]胡奇英,刘建庸.马尔可夫决策过程引论[M].西安电子科技大学出版社,2000.
[94]李响,陈小平.一种动态不确定性环境中的持续规划系统[J].计算机学报.2005,28(007):1163-1170.
[95]仵博,吴敏.部分可观察马尔可夫决策过程研究进展[J].计算机工程与设计.2007,28(009):2116-2119.
[96]Zhao W,Tong L,Swami A,et al.Decentralized cognitive MAC for opportunistic spectrum access in ad hoc networks:A POMDP framework[J].IEEE Journal on Selected Areas in Communications.2007,25(3):589-597.
[97]Poupart P,Boutilier C.Value-directed compression of POMDPs[J].Advances in Neural Information Processing Systems.2003,22(2):1579-1586.
[98]Pineau J,Gordon G,Thrun S.Point-based value iteration:An anytime algorithm for POMDPs[C].The International Joint Conference on Artificial Intelligence.2003:1025-1030.
[99]Roy N,Gordon G,Thrun S.Finding approximate POMDP solutions through belief compression[J].Journal of Artificial Intelligence Research.2005,2(3):1-40.
[100]杨公平,曾广周.基于导航的迁移工作流组织与执行[J].吉林大学学报.2006,36(5):819-823.
[101]Resnick P,Varian H R.Recommender systems[J].Communications of the ACM.1997,40(3):56-58.
[102]Felfernig A,Friedrich G,Schmidt-thieme L.Recommender Systems[J].IEEE Intelligent Systems.2007,22(3):18-26.
[103]Tintarev N,Masthoff J.A Survey of Explanations in Recommender Systems[C].IEEE 23rd International Conference on Data Engineering Workshop.2007:801-810.
[104]Cho Y H,Kim J K,Kim S H.A personalized recommender system based on web usage mining and decision tree induction[J].Expert Systems With Applications.2002,23(3):329-342.
[105]Pazzani M J,Billsus D.Content-Based Recommendation Systems[J].Lecture Notes in Computer Science.2007,4(1):325-336.
[106]Goldberg D,Nichols D,Oki B M,et al.Using collaborative filtering to weave an information tapestry[J].Communications of the ACM.1992,35(12):61-70.
[107]Cho Y H,Kim J K.Application of Web usage mining and product taxonomy to collaborative recommendations in e-commerce[J].Expert Systems With Applications.2004,26(2):233-246.
[108]Balabanovi M,Shoham Y.Fab:content-based,collaborative recommendation[J].Communications of the ACM 1997,40(3):66-72.
[109]Cardoso J,Netlibrary I.Semantic Web Services:Theory,Tools and Applications[M].Information Science Reference,2007.
[110]Roman D,Lausen H,Keller U,De B J,Bussler C,Domingue J,Fensel D,Hepp M,Kifer M,K R B.D2v1.2.Web Service Modeling Ontology(WSMO)[R].Cambridge:W3C,2005.
[111]Feeley M,Hutchinson N,Ray S.Realistic Mobility for Mobile Ad Hoc Network Simulation[J].Lecture notes in computer science.2004:324-329.
[112]Kato T,Ono M,Higaki H.Parallelization of GloMoSim Wireless Network Simulator[R].IPSJ SIG Technical Reports.2006,(121):55-58.
[113]Lee S J,Su W,Gerla M.On-demand multicast routing protocol in multihop wireless mobile networks[J].Mobile Networks and Applications.2002,7(6):441-453.
[114]Bae S H,Lee S J,Su W,et al.The design,implementation,and performance evaluation of the on-demand multicast routing protocol in multihop wireless networks[J].Network.2000,14(1):70-77.
[115]赵纯均,陈剑.虚拟企业及其构建研究[J].系统工程理论与实践.2002,22(1):49-55.
[116]张维迎.博弈论与信息经济学[M].上海人民出版社,2004.
[117]黄涛.博弈论教程--理论 应用[M].北京:首都经济贸易大学出版社,2004.
[118]Nash J F.Equilibrium points in n-person games[C].Proceeding of the National Academy of Sciences of the United States of America.1950:48-49.
[119]Gibbons R.A primer in game theory[M].Harvester Wheatsheaf,1994.
[120]Shapley L S,Shubik M.A method for evaluating the distribution of power in a committee system[J].The American Political Science Review.1954,2(1):787-792.
[121]Von N J,Morgenstem O.Theory of games and economic behavior[M].Princeton Univ Press,2004.
[122]Aumann R J,Maschler M.The bargaining set for cooperative games[J].Classics in Game Theory.1997,21(3):140-149.
[123]Lin Z.A new bargaining set of an n-person game and endogenous coalition formation[J].Games and Economic Behavior.1994,6(1):512-526.
[124]Davis M,Maschler M.The kernel of a cooperative game[J].Naval Research Logistics Quarterly.1965,12(3):223-259.
[125]Schmeidler D.The nucleolus of a characteristic function game[J].SIAM Journal on Applied Mathematics.1969,12(1):1163-1170.
[126]Curiel I J,Maschler M,Tijs S H.Bankruptcy games[J].Mathematical Methods of Operations Research.1987,31(5):143-159.
[127]Aumann R J.An axiomatization of the non-transferable utility value[J]. Econometrica: Journal of the Econometric Society. 1985,35(12): 599-612.
[128] Aumann R J. The core of a cooperative game without side payments[J].Transactions of the American Mathematical Society. 1961,23(2): 539-552.
[129] Aumann R J, Shapley L S, Aumann R J. Values of non-atomic games[M].Princeton University Press Princeton, 1974.
[130] Kirk D E. Optimal Control Theory: An Introduction[M]. Courier Dover Publications, 2004.
[131] Maskin E, Tirole J. Markov Perfect Equilibrium Observable actions[J]. Journal of Economic Theory. 2001, 100(2): 191-219.
[132] Ericson R, Pakes A. Markov-Perfect Industry Dynamics: A Framework for Empirical Work[J]. The Review of Economic Studies. 1995, 62(1): 53-82.
[133] Shorrocks A F. Decomposition Procedures for Distributional Analysis: A Unified Framework Based on the Shapley ValuefM]. University of Essex. 1999.
[134] Hsiao C R, Raghavan T E. The Shapley value for multi-choice cooperative games[D]. University of Illinois at Chicago, 1991.
[135] Jin M, Wu S D. Procurement auctions with supplier coalitions: validity requirements and mechanism design[R]. Lehigh University working paper, 2002.