Modeling and Analyzing Time Constrains for Service Composition
As a way to compose independent services together to ful.ll a function, service composition is widely applied in different applications. One key issue is how to model and analyze time-related properties in service composition so that it can satisfy users deadline requirements. A model called service composition time-constrained Petri net (SCTNet) is introduced in the paper, which is capable of capturing time behavior of services accurately. The basic relationships, priority and preemption constraints between service are also characterized based on SCT-Net. In order to reduce the state space of model, we propose four simpli.- cation schemas which can maintain structural feature and time delay of SCT-Net. We advance the concept of greatest concurrent set, and a heuristic algorithm for schedule computation is given. Finally, two speci.c experiments demonstrate the feasibility and practicability of our method.
Service composition time constrain Petri net preemptive priority
Guisheng Fan Huiqun Yu Dongmei Liu Liqiong Chen
Department of Computer Science and Engineering East China University of Science and Technology, Shanghai 200237, China
国际会议
The 9th International Conference for Young Computer Scientists(第九届国际青年计算机大会)
安徽黄山
英文
124-129
2008-11-18（万方平台首次上网日期，不代表论文的发表时间）