Formal Modeling and Verification for Web Service Composition

Tian, Baojun; Gu, Yanlin

doi:10.4304/jsw.8.11.2733-2737

Cited by 8 publications

(5 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…An approach was presented called Colored Petri net-based method (CPN) [9] for formal modeling and verification of web service composition. CPN was an extended version of Petri net which is a graphical formal method.…”

Section: An Optimal Composition Plan Selection Using Multi Objective mentioning

confidence: 99%

An Optimal Composition Plan Selection Using Multi Objective Particle Swarm Optimization

Parimalam¹,

K²

2019

IJCET

View full text Add to dashboard Cite

Domain-ontology based Particle Swarm Optimization (PSO)-inspired Balanced Iterative Reducing and Clustering using Hierarchies (BIRCH) and Improved Bipartite graph is an efficient web service composition approach. It composed a number of web services to achieve high customer satisfaction. It also improves the clustering quality and reduced the processing time of web service composition. The most verification problems are easily verified by using Petri Net in planning, verification and execution phase. In order to provide more efficient automatic web service composition, in this paper multiple Quality of Service (QoS) parameters like cost, accuracy, accessibility, robustness, scalability, modifiability and security are included in Petri net-based algebra approach. While adding a greater number of QoS parameters there will be multi-objective services composition optimization problem. It is solved by introducing a Multi-Objective Genetic Algorithm (MOGA) and Multi-Objective PSO (MOPSO) algorithm. It selects qualitative different services from multiple functionally identical web services which achieve the best reliability model. Thus, the automatic web service composition is performed for discovering the appropriate services by satisfying the customer requirements. Experimental results show that the proposed method performs better than the existing method.

show abstract

Section: An Optimal Composition Plan Selection Using Multi Objective mentioning

confidence: 99%

An Optimal Composition Plan Selection Using Multi Objective Particle Swarm Optimization

Parimalam¹,

K²

2019

IJCET

View full text Add to dashboard Cite

show abstract

“…Regarding the novelty of the work presented in this paper, we want to note that using model checking to solve the Web service composition or Web service verification has already been reported in [5,10,[12][13][14]. Likewise, Web service indexing for faster composition is also not a new idea, see [8,9,15].…”

Section: • We Apply Some Heuristic Based On the Characteristics Ofmentioning

confidence: 99%

“…WSC only involves the functional properties (hard constraints) which is the classic problem of SOA, which are mostly based on the theory of planning of the artificial intelligence field (AI Planning), such as [4] and [19]. Some recent studies are based on abstract models, such as Petri net or Colored Petri Net [12][13][14] to compose and verify Web services. PORSCE II [4] is a framework implementing the WSC-based on the requirements on input and output of the services.…”

Section: Composition Based On Hard Constraintsmentioning

confidence: 99%

See 1 more Smart Citation

A bitwise-based indexing and heuristic-driven on-the-fly approach for Web service composition and verification

Huynh

Tho

Bui

2016

Vietnam J Comput Sci

View full text Add to dashboard Cite

During the last decade, software engineering community has witnessed the emerging of SOA architecture, where Web services play a crucial role. It prompts the concept of Web Service Composition (WSC). Even though interesting, this issue posed some remarkable challenges, one of which is constraint handling. To be more precise, one needs to ensure that the composite Web service fulfills, at the same time, many constraints, including functional constraints, Quality of Service (QoS), and the execution order of the component services, or temporal relations. Those constraints are of different natures, thus finding an efficient verification on all kinds of constraints during the composition process is by no means a trivial task. Backed by a solid foundation of temporal logic, model checking (MC) is a suitable approach to handle this issue. However, MC-based approach suffers from the infamous problem of state-space explosion, making it limited when applied to real-life situations. The work in this paper addresses the problem by proposing various approaches for handling the state-space exploration, including (i) an introduction of an LTS-based model known as LTS4WS, which can avoid generating full schema of Web service composition and allow on-the-fly verification on the state space; (ii) heuristics strategies to find the best potential composition, and (iii) a bitwise-based indexing mechanism for fast location of suitable Web services. All of those approaches are unified in a single tool, known as

show abstract

“…Por otra parte en [11], se presenta una metodología para el desarrollo de los SW basados en diagramas de secuencia en UML 2.0 como especificaciones de partida en la composición de SW, estos diagramas se traducen en lenguaje WS-CDL. Además en [12], se propone un método basado en CPN que detecta los errores en la fase de diseño y asegura la exactitud de la composición de servicios para un análisis estructural estático y un análisis de comportamiento dinámico, presentando un ejemplo del mapeo entre los elementos de la composición de SW y CPN. Así mismo en [13], se presenta la herramienta WSCVT, la cual utiliza Java para verificar un algoritmo RBSR, en donde el enfoque propuesto se verifica utilizando la herramienta WSCVT y los resultados revelaron un mejor rendimiento en términos de evitar problemas de escasez y accesibilidad.…”

Section: Trabajos Relacionadosunclassified

Mecanismo de transformación de diagramas UML de casos de uso a código WSCDL

Machorro-Cano¹,

Navarro²,

Alor-Hernández³

et al. 2015

RCS

View full text Add to dashboard Cite

Resumen. Los diagramas UML de Casos de Uso definen el comportamiento de un sistema a través de las interacciones de los actores y los procesos, además determinan los requisitos funcionales del sistema. Adicionalmente, las empresas están diseñando sus procesos de negocios mediante la tecnología de servicios Web y UML se ha posicionado como un lenguaje estándar de modelado para el desarrollo de aplicaciones. Por otra parte, con la utilización de las tecnologías de servicios Web y UML, es posible modelar nuevos procesos de negocios más complejos, los cuales requieren de mecanismos para lograr una mejor interoperabilidad a nivel empresarial. Estos mecanismos se logran a través de lenguajes composicionales en servicios Web como WS-CDL el cual se basa en XML. Este trabajo presenta un mecanismo de transformación que permite la generación de código WSCDL a partir de diagramas UML de Casos de Uso y un caso de estudio para ejemplificar su funcionalidad. Palabras clave: mecanismo de transformación, WS-CDL, diagramas de casos de uso.

show abstract

Formal Modeling and Verification for Web Service Composition

Cited by 8 publications

References 9 publications

An Optimal Composition Plan Selection Using Multi Objective Particle Swarm Optimization

An Optimal Composition Plan Selection Using Multi Objective Particle Swarm Optimization

A bitwise-based indexing and heuristic-driven on-the-fly approach for Web service composition and verification

Mecanismo de transformación de diagramas UML de casos de uso a código WSCDL

Contact Info

Product

Resources

About