Name
Abstract | ||
|---|---|---|
As a way to compose independent services together to fulfill a function, service composition is an important means for flexible and rapid information integration of complex distribution application in open and heterogeneous environment. Because the participating services may be failure or unavailable, how to guarantee the quality of service composition has become a challenging problem. A service composition model based on Timed Petri net (SCTPN) is proposed in this paper, which is capable of accurately capturing transaction behaviors and time constraints of services. The basic relationships and failure processing strategies between services are also characterized by SCTPN model. Based on states of the constructed SCTPN model, we propose the concepts of greatest concurrent set and transfer matrix to analyze reliability related properties of SCTPN model. Two simplification schemas are established to reduce the complexity of computation. Finally, three specific experiments are conducted to explain the effectiveness of proposed method. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/ICIS.2009.77 | ACIS-ICIS |
Keywords | Field | DocType |
time constrained service composition,basic relationship,open-heterogeneous environment,sctpn model,priority,preemptive,web services,independent service,time constrain,service composition model,petri nets,greatest concurrent set,concurrent set,concurrency control,service composition,timed petri net,set theory,transfer matrix,time constrained service composition reliability,computational complexity,failure analysis,formal languages,petri net,challenging problem,transaction behavior,formal language,analyzing reliability,failure processing strategy,complex distribution application,information integration,data mining,computer science,computational modeling,distributed application,quality of service,silicon,reliability,distributed computing,reliability engineering,information science,information analysis,computer networks | Information integration,Petri net,Formal language,Concurrency control,Computer science,Quality of service,Database transaction,Web service,Computational complexity theory,Distributed computing | Conference |
ISBN | Citations | PageRank |
978-0-7695-3641-5 | 1 | 0.36 |
References | Authors | |
11 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Guisheng Fan | 1 | 91 | 25.45 |
| Huiqun Yu | 2 | 191 | 36.27 |
| Liqiong Chen | 3 | 75 | 19.61 |
| Dongmei Liu | 4 | 75 | 12.42 |