In order to enable quality-aware web services selection in the process of service composition,this paper first describes the non-functional requirements of service consumers and the quality of elementary service or co...In order to enable quality-aware web services selection in the process of service composition,this paper first describes the non-functional requirements of service consumers and the quality of elementary service or composite service as a quality vector,and then models the QoS（quality of service）-aware composition as a multiple criteria optimization problem in extending directed graph.A novel simulated annealing algorithm for QoS-aware web services composition is presented.A normalizing for composite service QoS values is made,and a secondary iterative optimization is used in the algorithm.Experimental results show that the simulated annealing algorithm can satisfy the multiple criteria and global QoS requirements of service consumers.The algorithm produces near optimum solution with much less computation cost.展开更多
In order to achieve adaptive and efficient service composition, a task-oriented algorithm for discovering services is proposed. The traditional process of service composition is divided into semantic discovery and fun...In order to achieve adaptive and efficient service composition, a task-oriented algorithm for discovering services is proposed. The traditional process of service composition is divided into semantic discovery and functional matching and makes tasks be operation objects. Semantic similarity is used to discover services matching a specific task and then generate a corresponding task-oriented web service composition （TWC） graph. Moreover, an algorithm for the new service is designed to update the TWC. The approach is applied to the composition model, in which the TWC is searched to obtain an optimal path and the final service composition is output. Also, the model can implement realtime updating with changing environments. Experimental results demonstrate the feasibility and effectiveness of the algorithm and indicate that the maximum searching radius can be set to 2 to achieve an equilibrium point of quality and quantity.展开更多
Due to the fact that the existing web service description methods cannot address the issue of service reuse of various levels of granularity, the concept of service component is introduced, which packages together web...Due to the fact that the existing web service description methods cannot address the issue of service reuse of various levels of granularity, the concept of service component is introduced, which packages together web services and choreography, and their operations and properties are presented in a consistent and uniform manner. Service components are published externally as normal web services and can thus be employed by webbased applications. In order to improve reusability and testability of service components, the concept of composition pattern is also proposed, which presents the relationships among service components. The relationships and relationship compositions have a rigorous semantic, so that composite components can be validated at the configuration stage. The composition patterns support to integrate service components of various levels of granularity. Experience indicates that the application assembly can effectively be conducted by understanding, selecting, and reusing components easily.展开更多
In order to improve the effectiveness of the artificial intelligence （AI） planning based web service composition problem, a business domain oriented AI planning algorithm for web service composition is introduced. T...In order to improve the effectiveness of the artificial intelligence （AI） planning based web service composition problem, a business domain oriented AI planning algorithm for web service composition is introduced. The algorithm uses the proposed business relation model to minimize the searching space and uses the proposed goal distance as a heuristic rule. Compared with other algorithms tackling web service composition such as AI planning, the proposed algorithm focuses not only on how to convert the web service composition problem to the AI planning problem, but also exerts its effort on how to apply the business feature of web service composition into planning in order to improve the effectiveness. The experiment shows the better performance of the proposed algorithm.展开更多
In order to formally reason and verify web services composition described by web services choreography specification WS-CDL,a typed formal model named typed Abstract WS-CDL（web services choreography description langu...In order to formally reason and verify web services composition described by web services choreography specification WS-CDL,a typed formal model named typed Abstract WS-CDL（web services choreography description language）for WS-CDL specifications is proposed.In typed Abstract WS-CDL,the syntax of type and session,typing rules and operational semantics are formalized;the collaborations of web services are formally described by sessions;the operational semantics of a session can help to formally reason the execution of the choreography;the typing rules can help to formally check the data type consistency of exchanged information between web services and capture run-time errors due to type mismatches.Particularly,the concepts of type assumption set extension and type assumption set compatibility are proposed,and the merging algorithm of type assumption sets is defined so as to eliminate type assumption conflict.Based on the formal model,typed mapping rules for mapping web services choreography to orchestration is also defined.With the typed mapping rules,orchestration stubs and their type assumption sets can be generated from a given choreography; thus, web services composition can be verified at choreography and orchestration levels,respectively.The model is proved to have properties of type safety,and how the model can help to reason and verify web services composition is illustrated through a case study.展开更多
Applying dynamic web services composition is one of the important schemas for solving service-oriented architecture （SOA）and service-oriented computing（SOC）.For implementing dynamic web services composition,the mu...Applying dynamic web services composition is one of the important schemas for solving service-oriented architecture （SOA）and service-oriented computing（SOC）.For implementing dynamic web services composition,the multi agent system （MAS）is applied to web services composition.First, the essentials of the MAS and web services composition are analyzed and their relationship is discussed.Secondly, an MAS-based architecture is designed for dynamic web services composition,and it is named as CSMWC.A Jade tool is used to implement the major components.The architecture can primarily implement syntactic level dynamic web services composition,and it gives a basis for semantic level dynamic web services composition.For specifying the correctness of the architecture,by using pi-calculus,the architecture of the MAS is formally described,and its dynamic properties and adaptability are reasoned.Finally,it demonstrates the idea proposed by the Pi4SOA tool.展开更多
In order to improve the design and implementation quality of web service compositions,formal methods are used to model them and certain properties are verified.WCFA （web service interface control flow automata）is us...In order to improve the design and implementation quality of web service compositions,formal methods are used to model them and certain properties are verified.WCFA （web service interface control flow automata）is used to model web services,especially the control flow and possible interactions with other web services.A web service composition consists of a set of interacting WCFA.The global behavior of web service compositions is captured by NWA（nested word automata）.A variation of the depth-first search algorithm is used to transform a set of WCFA into an NWA.State formulae and call stacks at each node of NWA are computed by a path-sensitive reachability analysis.Safety properties,call stack inspection properties and pre/post-conditions of service invocations are described by assertions.Then verification of these assertions is carried out by an automated SAT tool.展开更多
For the problem of dynamic optimization in Web services composition, this paper presents a novel approach for selecting optimum Web services, which is based on the longest path method of weighted multistage graph. We ...For the problem of dynamic optimization in Web services composition, this paper presents a novel approach for selecting optimum Web services, which is based on the longest path method of weighted multistage graph. We propose and implement an Immune Algorithm for global optimization to construct composed Web services. Results of the experimentation illustrates that the algorithm in this paper has a powerful capability and can greatly improve the efficiency and veracity in service selection.展开更多
Based on the deficiency of time convergence and variability of Web services selection for services composition supporting cross-enterprises collaboration,an algorithm QCDSS(QoS constraints of dynamic Web services sele...Based on the deficiency of time convergence and variability of Web services selection for services composition supporting cross-enterprises collaboration,an algorithm QCDSS(QoS constraints of dynamic Web services selection)to resolve dynamic Web services selection with QoS global optimal path,was proposed.The essence of the algorithm was that the problem of dynamic Web services selection with QoS global optimal path was transformed into a multi-objective services composition optimization problem with QoS constraints.The operations of the cross and mutation in genetic algorithm were brought into PSOA(particle swarm optimization algorithm),forming an improved algorithm(IPSOA)to solve the QoS global optimal problem.Theoretical analysis and experimental results indicate that the algorithm can better satisfy the time convergence requirement for Web services composition supporting cross-enterprises collaboration than the traditional algorithms.展开更多
In order to realize automatic web service composition, a heuristic web service composition method based on domain ontology is proposed. First, this method integrates the domain ontology and the artificial intelligence...In order to realize automatic web service composition, a heuristic web service composition method based on domain ontology is proposed. First, this method integrates the domain ontology and the artificial intelligence （AI） planning algorithm. Then, it uses the domain ontology and its reasoning capability to infer the semantic relationship among parameters. Finally, it transforms the web service composition problem into the planning problem based on the AI planning heuristic algorithm. The preliminary experimental results show that the above method compensates for the lack of semantics in the previous AI planning method and it can satisfy the requirements of quality and efficiency of composition, thus generating composite web services according to customer requirements automatically and efficiently.展开更多
Communicating Sequential Processes （CSP） is a kind of process algebra, which is suitable for modeling and verifying Web service composition. This paper describes how to model Web service composition with CSP. A set ...Communicating Sequential Processes （CSP） is a kind of process algebra, which is suitable for modeling and verifying Web service composition. This paper describes how to model Web service composition with CSP. A set of rules for translating composition constructor of Business Process Execution Language for Web Services （BPEL4WS） to CSP notations is defined. According to the rules that have been defined, the corresponding translation algorithm is designed and illustrated with examples . The methods for model checking, model verification and model simulation are also introduced.展开更多
A novel layered method was proposed to solve the problem of Web services composition.In this method,services composition problem was formally transformed into the optimal matching problem of every layer,then optimal m...A novel layered method was proposed to solve the problem of Web services composition.In this method,services composition problem was formally transformed into the optimal matching problem of every layer,then optimal matching problem was modeled based on the hypergraph theory,and solved by computing the minimal transversals of the hypergraph.Meanwhile,two optimization algorithms were designed to discard some useless states at the intermediary steps of the composition algorithm.The effectiveness of the composition method was tested by a set of experiments,in addition,an example regarding the travel services composition was also given.The experimental results show that this method not only can automatically generate composition tree whose leaf nodes correspond to services composition solutions,but also has better performance on execution time and solution quality by adopting two proposed optimization algorithms.展开更多
Objective To solve the three principal problems for reusing the software components, i.e., existence, discovery and availability principles, web services provided a new solution for reusing and assembling web software...Objective To solve the three principal problems for reusing the software components, i.e., existence, discovery and availability principles, web services provided a new solution for reusing and assembling web software or components under distributed environment with a series of XML-based protocols. Methods A 4+1 meta-model between atomic services, such as Sequence, Parallelism, Alternation, Substitute and Iteration, and a kind of service composition description language in composition process are investigated. Furthermore, an architecture-based service composition model with Ontology Engine is proposed, which is based on the software architecture life-cycle model and provides a mechanism for services composition with dynamic management and deployment. Results The results of the prototype system development show that the service-composed application not only reused the web service components, but also reused the data resources located in distributed databases. Conclusion The method of reused-based web services composition observably decreases the period and cost of development and greatly improves the programming efficiency.展开更多
This paper proposes a method of data-flow testing for Web services composition.Firstly,to facilitate data flow analysis and constraints collecting,the existing model representation of business process execution langua...This paper proposes a method of data-flow testing for Web services composition.Firstly,to facilitate data flow analysis and constraints collecting,the existing model representation of business process execution language(BPEL)is modified in company with the analysis of data dependency and an exact representation of dead path elimination(DPE)is proposed,which over-comes the difficulties brought to dataflow analysis.Then defining and using information based on data flow rules is collected by parsing BPEL and Web services description language(WSDL)documents and the def-use annotated control flow graph is created.Based on this model,data-flow anomalies which indicate potential errors can be discovered by traversing the paths of graph,and all-du-paths used in dynamic data flow testing for Web services composition are automatically generated,then testers can design the test cases according to the collected constraints for each path selected.展开更多
In this paper, a model based colored Petri net （CPN） to provide semantic support for web service composition is proposed, and the reliability and maintainability of composite services are improved. The composite con...In this paper, a model based colored Petri net （CPN） to provide semantic support for web service composition is proposed, and the reliability and maintainability of composite services are improved. The composite constructs in the model are sequence, concurrent, choice, loop and replace. The web service is formally defined by a CPN. A closed composing algebra is defined to obtain a framework which enables declarative composition of web services. Availability, confidentiality, and integrity of composite service are analyzed within the framework of the model based CPN.展开更多
Various fishery information systems have been developed in different times and on different platforms. Wet） service application composition is crucial in the sharing and integration of fishery data and information. I...Various fishery information systems have been developed in different times and on different platforms. Wet） service application composition is crucial in the sharing and integration of fishery data and information. In the present paper, a heuristic web service composition method based on fishery ontology is presented, and the proposed web services are described. Ontology reasoning capability was applied to generate a service composition graph. The heuristic function was introduced to reduce the searching space. The experimental results show that the algorithm used considers the services semantic similarity and adiusts web service composition plan by dynamically relying on the empirical data.展开更多
Service-oriented architecture is becoming a major software framework for complex application and it can be dynamically and flexibly composed by integrating existing component web services provided by different provide...Service-oriented architecture is becoming a major software framework for complex application and it can be dynamically and flexibly composed by integrating existing component web services provided by different providers with standard protocols. The rapid introduction of new web services into a dynamic business environment can adversely affect the service quality and user satisfaction. Therefore, how to leverage, aggregate and make use of individual component’s quality of service (QoS) information to derive the optimal QoS of the composite service which meets the needs of users is still an ongoing hot research problem. This study aims at reviewing the advance of the current state-of-the-art in technologies and inspiring the possible new ideas for web service selection and composition, especially with nature-inspired computing approaches. Firstly, the background knowledge of web services is presented. Secondly, various nature-inspired web selection and composition approaches are systematically reviewed and analysed for QoS-aware web services. Finally, challenges, remarks and discussions about QoS-aware web service composition are presented.展开更多
By analyzing of the existing Web services,an ontology based on OWL is presented,which has rich semantic information,and the service description language OWL-S based on OWL is put forward. OWL-S through IOPE can descri...By analyzing of the existing Web services,an ontology based on OWL is presented,which has rich semantic information,and the service description language OWL-S based on OWL is put forward. OWL-S through IOPE can describe services,can also combine the service,but the method of combination service is not automatic. So a method is presented by using Situation Calculus for automatic service composition based on the OWL-S model. Finally through the example analysis,the method of automatic service combination was validated.展开更多
Web quality of service (QoS) awareness requires not only the selection of specific services to complete specific tasks, but also the comprehensive quality of service of the whole web service composition. How to select...Web quality of service (QoS) awareness requires not only the selection of specific services to complete specific tasks, but also the comprehensive quality of service of the whole web service composition. How to select the web service composition with the highest comprehensive QoS is a NP hard problem. In this paper, an improved multi population genetic algorithm is proposed. Cosine adaptive operator is added to the algorithm to avoid premature algorithm caused by improper genetic operator and the disadvantage of destroying excellent individuals in later period. Experimental results show that compared with the common genetic algorithm and multi population genetic algorithm, this algorithm has the advantages of shorter time consumption and higher accuracy, and effectively avoids the loss of effective genes in the population.展开更多
To improve the Quality of Service (QoS)-aware Web service compositions considering constraints between cross-organizational business,this paper analyzes the types of constraints,and accordingly proposes a Chaos Geneti...To improve the Quality of Service (QoS)-aware Web service compositions considering constraints between cross-organizational business,this paper analyzes the types of constraints,and accordingly proposes a Chaos Genetic Algorithm (CGA). The algorithm creates an initial population of service compositions based on the chaos theory,and then processes individuals which violate constraints in the initial population using repair strategies. Next,a new fitness function is designed to gradually eliminate the infeasible compositions generated in evolution. Finally,the algorithm makes minor chaotic disturbances on the evolved group to accelerate convergence and avoid local optimum. Experimental results demonstrate the effectiveness of the proposed algorithm.展开更多
基金The National Natural Science Foundation of China(No.60773217)Free Exploration Project(985 Project of Renmin University of China)(No.21361231)
文摘In order to enable quality-aware web services selection in the process of service composition,this paper first describes the non-functional requirements of service consumers and the quality of elementary service or composite service as a quality vector,and then models the QoS（quality of service）-aware composition as a multiple criteria optimization problem in extending directed graph.A novel simulated annealing algorithm for QoS-aware web services composition is presented.A normalizing for composite service QoS values is made,and a secondary iterative optimization is used in the algorithm.Experimental results show that the simulated annealing algorithm can satisfy the multiple criteria and global QoS requirements of service consumers.The algorithm produces near optimum solution with much less computation cost.
基金The National Key Technology R&D Program of Chinaduring the 11th Five-Year Plan Period(No2007BAF23B0302)the Major Research Plan of the National Natural Science Foundation of China(No90818028)
文摘In order to achieve adaptive and efficient service composition, a task-oriented algorithm for discovering services is proposed. The traditional process of service composition is divided into semantic discovery and functional matching and makes tasks be operation objects. Semantic similarity is used to discover services matching a specific task and then generate a corresponding task-oriented web service composition （TWC） graph. Moreover, an algorithm for the new service is designed to update the TWC. The approach is applied to the composition model, in which the TWC is searched to obtain an optimal path and the final service composition is output. Also, the model can implement realtime updating with changing environments. Experimental results demonstrate the feasibility and effectiveness of the algorithm and indicate that the maximum searching radius can be set to 2 to achieve an equilibrium point of quality and quantity.
基金The National Basic Research Program of China (973Program) (No.1999032710).
文摘Due to the fact that the existing web service description methods cannot address the issue of service reuse of various levels of granularity, the concept of service component is introduced, which packages together web services and choreography, and their operations and properties are presented in a consistent and uniform manner. Service components are published externally as normal web services and can thus be employed by webbased applications. In order to improve reusability and testability of service components, the concept of composition pattern is also proposed, which presents the relationships among service components. The relationships and relationship compositions have a rigorous semantic, so that composite components can be validated at the configuration stage. The composition patterns support to integrate service components of various levels of granularity. Experience indicates that the application assembly can effectively be conducted by understanding, selecting, and reusing components easily.
基金The National Key Technologies R & D Program of China during the 10th Five-Year Plan Period(No2004BA721A05)
文摘In order to improve the effectiveness of the artificial intelligence （AI） planning based web service composition problem, a business domain oriented AI planning algorithm for web service composition is introduced. The algorithm uses the proposed business relation model to minimize the searching space and uses the proposed goal distance as a heuristic rule. Compared with other algorithms tackling web service composition such as AI planning, the proposed algorithm focuses not only on how to convert the web service composition problem to the AI planning problem, but also exerts its effort on how to apply the business feature of web service composition into planning in order to improve the effectiveness. The experiment shows the better performance of the proposed algorithm.
基金The National Natural Science Foundation of China(No.60403027,60773191,70771043)the National High Technology Research and Development Program of China(863 Program)(No.2007AA01Z403)
文摘In order to formally reason and verify web services composition described by web services choreography specification WS-CDL,a typed formal model named typed Abstract WS-CDL（web services choreography description language）for WS-CDL specifications is proposed.In typed Abstract WS-CDL,the syntax of type and session,typing rules and operational semantics are formalized;the collaborations of web services are formally described by sessions;the operational semantics of a session can help to formally reason the execution of the choreography;the typing rules can help to formally check the data type consistency of exchanged information between web services and capture run-time errors due to type mismatches.Particularly,the concepts of type assumption set extension and type assumption set compatibility are proposed,and the merging algorithm of type assumption sets is defined so as to eliminate type assumption conflict.Based on the formal model,typed mapping rules for mapping web services choreography to orchestration is also defined.With the typed mapping rules,orchestration stubs and their type assumption sets can be generated from a given choreography; thus, web services composition can be verified at choreography and orchestration levels,respectively.The model is proved to have properties of type safety,and how the model can help to reason and verify web services composition is illustrated through a case study.
基金The National Natural Science Foundation of China(No.90612014)IBM China Research Lab Joint Project
文摘Applying dynamic web services composition is one of the important schemas for solving service-oriented architecture （SOA）and service-oriented computing（SOC）.For implementing dynamic web services composition,the multi agent system （MAS）is applied to web services composition.First, the essentials of the MAS and web services composition are analyzed and their relationship is discussed.Secondly, an MAS-based architecture is designed for dynamic web services composition,and it is named as CSMWC.A Jade tool is used to implement the major components.The architecture can primarily implement syntactic level dynamic web services composition,and it gives a basis for semantic level dynamic web services composition.For specifying the correctness of the architecture,by using pi-calculus,the architecture of the MAS is formally described,and its dynamic properties and adaptability are reasoned.Finally,it demonstrates the idea proposed by the Pi4SOA tool.
基金The National Key Technology R&D Program of Chinaduring the 11th Five-Year Plan Period(No.2006BAH02A12)the National High Technology Research and Development Program of China(863 Program)(No.2006AA010101)
文摘In order to improve the design and implementation quality of web service compositions,formal methods are used to model them and certain properties are verified.WCFA （web service interface control flow automata）is used to model web services,especially the control flow and possible interactions with other web services.A web service composition consists of a set of interacting WCFA.The global behavior of web service compositions is captured by NWA（nested word automata）.A variation of the depth-first search algorithm is used to transform a set of WCFA into an NWA.State formulae and call stacks at each node of NWA are computed by a path-sensitive reachability analysis.Safety properties,call stack inspection properties and pre/post-conditions of service invocations are described by assertions.Then verification of these assertions is carried out by an automated SAT tool.
基金Supported by the National Key Technologies Re-search and Development Programinthe 10th Five-Year Plan of China(2004BA721A05)
文摘For the problem of dynamic optimization in Web services composition, this paper presents a novel approach for selecting optimum Web services, which is based on the longest path method of weighted multistage graph. We propose and implement an Immune Algorithm for global optimization to construct composed Web services. Results of the experimentation illustrates that the algorithm in this paper has a powerful capability and can greatly improve the efficiency and veracity in service selection.
基金Project(70631004)supported by the Key Project of the National Natural Science Foundation of ChinaProject(20080440988)supported by the Postdoctoral Science Foundation of China+1 种基金Project(09JJ4030)supported by the Natural Science Foundation of Hunan Province,ChinaProject supported by the Postdoctoral Science Foundation of Central South University,China
文摘Based on the deficiency of time convergence and variability of Web services selection for services composition supporting cross-enterprises collaboration,an algorithm QCDSS(QoS constraints of dynamic Web services selection)to resolve dynamic Web services selection with QoS global optimal path,was proposed.The essence of the algorithm was that the problem of dynamic Web services selection with QoS global optimal path was transformed into a multi-objective services composition optimization problem with QoS constraints.The operations of the cross and mutation in genetic algorithm were brought into PSOA(particle swarm optimization algorithm),forming an improved algorithm(IPSOA)to solve the QoS global optimal problem.Theoretical analysis and experimental results indicate that the algorithm can better satisfy the time convergence requirement for Web services composition supporting cross-enterprises collaboration than the traditional algorithms.
基金The National Natural Science Foundation of China(No60473078)the National High Technology Research and Develop-ment Program of China (863Program) (No2006AA010101)
文摘In order to realize automatic web service composition, a heuristic web service composition method based on domain ontology is proposed. First, this method integrates the domain ontology and the artificial intelligence （AI） planning algorithm. Then, it uses the domain ontology and its reasoning capability to infer the semantic relationship among parameters. Finally, it transforms the web service composition problem into the planning problem based on the AI planning heuristic algorithm. The preliminary experimental results show that the above method compensates for the lack of semantics in the previous AI planning method and it can satisfy the requirements of quality and efficiency of composition, thus generating composite web services according to customer requirements automatically and efficiently.
基金Supported by the National Natural Science Foun-dation of China(60403027) the Natural Science Foundation of HubeiProvince(2005ABA258) the Open Foundation of State Key La-boratory of Software Engineering (SKLSE05-07)
文摘Communicating Sequential Processes （CSP） is a kind of process algebra, which is suitable for modeling and verifying Web service composition. This paper describes how to model Web service composition with CSP. A set of rules for translating composition constructor of Business Process Execution Language for Web Services （BPEL4WS） to CSP notations is defined. According to the rules that have been defined, the corresponding translation algorithm is designed and illustrated with examples . The methods for model checking, model verification and model simulation are also introduced.
基金Project(2010CB328101) supported by the National Basic Research Program of ChinaProject(2009AA01Z401) supported by the National High Technology Research and Development Program of China+4 种基金Projects(60803032,90818023) supported by the National Natural Science Foundation of ChinaProjects(09510701300,09JC1414200,09DZ1120403) supported by the Shanghai Science and Technology Commission,China"Shu Guang" Project(10SG23) supported by Shanghai Municipal Education Commission and Shanghai Education Development Foundation,ChinaProject(09QA1405800) supported by Shanghai Science and Technology Commission Rising-Star Program,ChinaProject(NCET-10-0598) supported by Program for New Century Excellent Talents in Chinese University
文摘A novel layered method was proposed to solve the problem of Web services composition.In this method,services composition problem was formally transformed into the optimal matching problem of every layer,then optimal matching problem was modeled based on the hypergraph theory,and solved by computing the minimal transversals of the hypergraph.Meanwhile,two optimization algorithms were designed to discard some useless states at the intermediary steps of the composition algorithm.The effectiveness of the composition method was tested by a set of experiments,in addition,an example regarding the travel services composition was also given.The experimental results show that this method not only can automatically generate composition tree whose leaf nodes correspond to services composition solutions,but also has better performance on execution time and solution quality by adopting two proposed optimization algorithms.
文摘Objective To solve the three principal problems for reusing the software components, i.e., existence, discovery and availability principles, web services provided a new solution for reusing and assembling web software or components under distributed environment with a series of XML-based protocols. Methods A 4+1 meta-model between atomic services, such as Sequence, Parallelism, Alternation, Substitute and Iteration, and a kind of service composition description language in composition process are investigated. Furthermore, an architecture-based service composition model with Ontology Engine is proposed, which is based on the software architecture life-cycle model and provides a mechanism for services composition with dynamic management and deployment. Results The results of the prototype system development show that the service-composed application not only reused the web service components, but also reused the data resources located in distributed databases. Conclusion The method of reused-based web services composition observably decreases the period and cost of development and greatly improves the programming efficiency.
基金the National Natural Science Foundation of China(60425206,60503033)National Basic Research Program of China(973 Program,2002CB312000)Opening Foundation of State Key Laboratory of Software Engineering in Wuhan University
文摘This paper proposes a method of data-flow testing for Web services composition.Firstly,to facilitate data flow analysis and constraints collecting,the existing model representation of business process execution language(BPEL)is modified in company with the analysis of data dependency and an exact representation of dead path elimination(DPE)is proposed,which over-comes the difficulties brought to dataflow analysis.Then defining and using information based on data flow rules is collected by parsing BPEL and Web services description language(WSDL)documents and the def-use annotated control flow graph is created.Based on this model,data-flow anomalies which indicate potential errors can be discovered by traversing the paths of graph,and all-du-paths used in dynamic data flow testing for Web services composition are automatically generated,then testers can design the test cases according to the collected constraints for each path selected.
基金Project supported by the National Natural Science Foundation of China （Grant No.60403027）
文摘In this paper, a model based colored Petri net （CPN） to provide semantic support for web service composition is proposed, and the reliability and maintainability of composite services are improved. The composite constructs in the model are sequence, concurrent, choice, loop and replace. The web service is formally defined by a CPN. A closed composing algebra is defined to obtain a framework which enables declarative composition of web services. Availability, confidentiality, and integrity of composite service are analyzed within the framework of the model based CPN.
基金funded by the National High Technology Research and Development Program of China (2006AA10Z239)the Key Technologies R&D Program of China during the 11th Five-Year Plan period (2006BAD10A05)
文摘Various fishery information systems have been developed in different times and on different platforms. Wet） service application composition is crucial in the sharing and integration of fishery data and information. In the present paper, a heuristic web service composition method based on fishery ontology is presented, and the proposed web services are described. Ontology reasoning capability was applied to generate a service composition graph. The heuristic function was introduced to reduce the searching space. The experimental results show that the algorithm used considers the services semantic similarity and adiusts web service composition plan by dynamically relying on the empirical data.
基金supported by National Natural Science Foundation of China (71772060, 61873040, 61375066).
文摘Service-oriented architecture is becoming a major software framework for complex application and it can be dynamically and flexibly composed by integrating existing component web services provided by different providers with standard protocols. The rapid introduction of new web services into a dynamic business environment can adversely affect the service quality and user satisfaction. Therefore, how to leverage, aggregate and make use of individual component’s quality of service (QoS) information to derive the optimal QoS of the composite service which meets the needs of users is still an ongoing hot research problem. This study aims at reviewing the advance of the current state-of-the-art in technologies and inspiring the possible new ideas for web service selection and composition, especially with nature-inspired computing approaches. Firstly, the background knowledge of web services is presented. Secondly, various nature-inspired web selection and composition approaches are systematically reviewed and analysed for QoS-aware web services. Finally, challenges, remarks and discussions about QoS-aware web service composition are presented.
文摘By analyzing of the existing Web services,an ontology based on OWL is presented,which has rich semantic information,and the service description language OWL-S based on OWL is put forward. OWL-S through IOPE can describe services,can also combine the service,but the method of combination service is not automatic. So a method is presented by using Situation Calculus for automatic service composition based on the OWL-S model. Finally through the example analysis,the method of automatic service combination was validated.
文摘Web quality of service (QoS) awareness requires not only the selection of specific services to complete specific tasks, but also the comprehensive quality of service of the whole web service composition. How to select the web service composition with the highest comprehensive QoS is a NP hard problem. In this paper, an improved multi population genetic algorithm is proposed. Cosine adaptive operator is added to the algorithm to avoid premature algorithm caused by improper genetic operator and the disadvantage of destroying excellent individuals in later period. Experimental results show that compared with the common genetic algorithm and multi population genetic algorithm, this algorithm has the advantages of shorter time consumption and higher accuracy, and effectively avoids the loss of effective genes in the population.
基金National Natural Science Fund of China(61672022,61272036)Graduate Innovation Program of Shanghai Polytechnic University(A01GY17F022)Key Discipline of Shanghai Polytechnic University(XXKZD1604)
文摘To improve the Quality of Service (QoS)-aware Web service compositions considering constraints between cross-organizational business,this paper analyzes the types of constraints,and accordingly proposes a Chaos Genetic Algorithm (CGA). The algorithm creates an initial population of service compositions based on the chaos theory,and then processes individuals which violate constraints in the initial population using repair strategies. Next,a new fitness function is designed to gradually eliminate the infeasible compositions generated in evolution. Finally,the algorithm makes minor chaotic disturbances on the evolved group to accelerate convergence and avoid local optimum. Experimental results demonstrate the effectiveness of the proposed algorithm.
