Abstract
Currently, Service-Oriented Architecture (SOA) is becoming the most popular software architecture of contemporary enterprise applications, and one crucial technique of its implementation is web services. Individual service offered by some service providers may symbolize limited business functionality; however, by composing individual services from different service providers, a composite service describing the intact business process of an enterprise can be made. Many new standards have been defined to decipher web service composition problem namely Business Process Execution Language (BPEL). BPEL provides an initial work for forming an Extended Markup Language (XML) specification language for defining and implementing business practice workflows for web services. The problems with most realistic approaches to service composition are the verification of composed web services. It has to depend on formal verification method to ensure the correctness of composed services. A few research works has been carried out in the literature survey for verification of web services for deterministic system. Moreover the existing models did not address the verification properties like dead transition, deadlock, reachability and safetyness. In this paper, a new model to verify the composed web services using Enhanced Stacked Automata Model (ESAM) has been proposed. The correctness properties of the non-deterministic system have been evaluated based on the properties like dead transition, deadlock, safetyness, liveness and reachability.Initially web services are composed using Business Process Execution Language for Web Service (BPEL4WS) and it is converted into ESAM (combination of Muller Automata (MA) and Push Down Automata (PDA)) and it is transformed into Promela language, an input language for Simple ProMeLa Interpreter (SPIN) tool. The model is verified using SPIN tool and the results revealed better recital in terms of finding dead transition and deadlock in contrast to the existing models.
Highlights
Web services are disseminated and self-sufficient computational elements that solve specific tasks, varying from undemanding requests to multifaceted business processes and the information will be interacted using XML messages following the SOAP standard
This paper proposed an approach to derive the formal semantics of WS-Business Process Execution Language (BPEL) processes compositionally using Reo and constraint automata
RTESAM = STESAM–TAESAM Here the response time for CWS-PNs methodology is higher than proposed model and the Timed automata model
Summary
Web services are disseminated and self-sufficient computational elements that solve specific tasks, varying from undemanding requests to multifaceted business processes and the information will be interacted using XML messages following the SOAP standard. The composition and verification of web services are generally classified into four categories They are, timed automata, interface automata, colored Petrinet and model checking. Web service choreography description language (WSCDL) was used for composition of web services, converted into Timed Automata and verified using the tool called UPPAAL. Petrinet model were used for verification and validation of composite web services (Lohmann 2007; Foster et al 2006; Hamadi and Benatallah 2003; Verbeek & van der Aalst 2005; Yang et al 2005; Schmidt & Stahl 2004; Yi & Kochut 2004; Narayanan & McIlraith 2002). Used LTSA model checker to detect possible additional scenarios, checking and iterate tracing resolution
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
