Academia.eduAcademia.edu

Outline

Title
Abstract
Introduction
Related Work
Experimental Results
Conclusions and Future Work
References
All Topics
Computer Science
Software Engineering

A Model Checking Approach to Verify BPEL4WS Workflows

Profile image of Carlo GhezziCarlo Ghezzi

2007, IEEE International Conference on Service-Oriented Computing and Applications (SOCA '07)

Abstract

The increasing diffusion of service oriented computing in critical business transactions demands reliability and correctness of the workflow logic representing web service orchestrations. We present an approach for the formal verification of workflow-based compositions of web services, described in BPEL4WS. Workflow processes can be verified in isolation, assuming that the external services invoked are known only through their interface. It is also possible to verify that the actual composition of two or more processes behaves correctly. We can verify deadlock freedom, properties expressed as data-bound assertions written in WS-CoL, a specification language for web services, and LTL temporal properties. Our approach is based on the software model checker Bogor, whose language supports the modeling of all BPEL4WS constructs. We provide an empirical evaluation of our approach and we compare the results with other BPEL4WS model checking tools.

Related papers

Model-based verification of web service compositions
Jeff Kramer

2003

In this paper we discuss a model-based approach to verifying web service compositions for web service implementations. The approach supports verification against specification models and assigns semantics to the behavior of implementation models so as to confirm expected results for both the designer and implementer. Specifications of the design are modeled in UML, in the form of Message Sequence Charts (MSCs), and mechanically compiled into the Finite State Process notation (FSP) to concisely describe and reason about the concurrent programs. Implementations are mechanically translated to FSP to allow a trace equivalence verification process to be performed. By providing early design verification, the implementation, testing and deployment of web service compositions can be eased through the understanding of the differences, limitations and undesirable traces allowed by the composition. The approach is supported by a suite of cooperating tools for specification, formal modeling and trace animation of the composition workflow.

View PDFchevron_right
LTSA-WS: a tool for modelbased verification of web service compositions and choreography
Jeff Kramer

2006

In this paper we describe a tool for a model-based approach to verifying compositions of web service implementations. The tool supports verification of properties created from design specifications and implementation models to confirm expected results from the viewpoints of both the designer and implementer. Scenarios are modeled in UML, in the form of Message Sequence Charts (MSCs), and then compiled into the Finite State Process (FSP) process algebra to concisely model the required behavior. BPEL4WS implementations are mechanically translated to FSP to allow an equivalence trace verification process to be performed. By providing early design verification and validation, the implementation, testing and deployment of web service compositions can be eased through the understanding of the behavior exhibited by the composition. The approach is implemented as a plug-in for the Eclipse development environment providing cooperating tools for specification, formal modeling, verification and validation of the composition process.

View PDFchevron_right
Model-checking Web Services Orchestrations using BP-calculus
Faisal Abouzaid

Electronic Notes in Theoretical Computer Science, 2009

The Business Process Execution Language for Web Services (BPEL) is the standard for implementing orchestrated business processes designed but not limited to, as web services. BPEL is a powerful language but lacks a widely accepted formal semantics, and this makes it difficult to formally validate the correct execution of BPEL implementations. In the other hand, process algebras have proved their efficiency in the specification of web services orchestrations. In this paper we improve the BP-calculus, a π-calculus based formalism designed to ease the automatic generation of verified BPEL code, by defining specific equivalence and logic in order to verify BPEL implementations through their formal specification expressed in this calculus. The formal specification of service-oriented applications allows the checking of functional properties described by means of the new logic, that is shown to be well suited to capture peculiar aspects of services formalized in π-like languages. As an illustrative example, we present the BP-calculus specification and the verification results of a trade market service scenario.

View PDFchevron_right
Model-driven approach supporting formal verification for web service composition protocols
Pascal Lorenz

Journal of Network and Computer Applications, 2013

Composite Web services development is a complex task involving specification, verification, implementation, and testing. Despite the fact that several languages have been proposed for composing Web services (e.g., BPEL, WSCI), there is a lack of well-defined formal semantics for formal analysis and verification. Moreover, current approaches are specific to a given programming language (e.g. BPEL) and they focus only on the verification of already implemented composite services. This paper proposes an approach for specifying, verifying and implementing composite services according to the Model-Driven Architecture principles. It makes use of formal methods, especially the LOTOS formal description language, to support composition verification at specification time. The benefit is that the composition specification is proven to be correct before its implementation with a programming language such as BPEL. A case study is also presented to show how a service composition can be specified in a workflow and then formally verified before executable code generation.

View PDFchevron_right
Validation of web service compositions
Carlo Ghezzi

IET Software, 2007

Web services support software architectures that can evolve dynamically. In particular, here we focus on architectures where services are composed (orchestrated) through a workflow described in the BPEL language. We assume that the resulting composite service refers to external services through assertions that specify their expected functional and non-functional properties. Based on these assertions, the composite service may be verified at design time by checking that it ensures certain relevant properties. Because of the dynamic nature of Web services and the multiple stakeholders involved in their provision, however, the external services may evolve dynamically, and even unexpectedly. They may become inconsistent with respect to the assertions against which the workflow was verified during development. As a consequence, validation of the composition must extend to run time. We introduce an assertion language, called AL-BERT, which can be used to specify both functional and non-functional properties. We also describe an environment which supports design-time verification of ALBERT assertions for BPEL workflows via model checking. At run time, the assertions can be turned into checks that a software monitor performs on the composite system to verify that it continues to guarantee its required properties. A TeleAssistance application is provided as a running example to illustrate our validation framework.

View PDFchevron_right
A method of verifying web service composition
Quỳnh Mai Vũ Thị

Proceedings of the 2010 Symposium on Information and Communication Technology - SoICT '10, 2010

Service composition is one of the primary tasks in developing service-oriented systems. However, there are currently some challenges to check its correction. In this paper, we propose a visual methodology and a tool for verifying business processes written in BPEL by using the SPIN model checker. We present algorithms to translate BPEL processes into PROMELA programs via labeled control flow graphs. The use of label control graphs in the tool will help regular users understand BPEL business processes and the verification process with a model checker more easily. Finally, the Spin model checker will verify important properties of the PROMELA program that represents a BPEL business process..

View PDFchevron_right

References (33)

  1. T. Andrews, F. Curbera, H. Dholakia, Y. Goland, J. Klein, F. Leymann, K. Liu, D. Roller, D. Smith, S. Thatte, I. Trick- ovic, and S. Weerawarana. Business Process Execution Lan- guage for Web Services, Version 1.1. Technical report, OA- SIS, 2003-05-05 2003.
  2. T. Andrews, S. Qadeer, S. K. Rajamani, and Y. Xie. Zing: Exploiting program structure for model checking concurrent software. In P. Gardner and N. Yoshida, editors, CONCUR 2004 -Concurrency Theory, 15th International Conference, Proceedings, volume 3170 of Lecture Notes in Computer Science, pages 1-15. Springer, 2004.
  3. A. Ankolekar. OWL-S Semantic Markup for Web Services, 2003. http://www.daml.org/services/owl-s/.
  4. J. Arias-Fisteus, L. S. Fernández, and C. D. Kloos. Formal Verification of BPEL4WS Business Collaborations. In E- Commerce and Web Technologies, 5th International Confer- ence, EC-Web 2004, Proceedings, volume 3182 of Lecture Notes in Computer Science, pages 76-85. Springer, 2004.
  5. L. Baresi, E. Di Nitto, and C. Ghezzi. Towards Open-World Software: Issues and Challenges. IEEE Computer, 39:36- 43, October 2006.
  6. L. Baresi, C. Ghezzi, and L. Mottola. Towards Fine-grained Automated Verification of Publish-Subscribe Architectures. In Proceedings of the 26th International Conference on Formal Methods for Networked and Distributed Systems (FORTE06), Paris, September 2006.
  7. L. Baresi and S. Guinea. Towards Dynamic Monitoring of WS-BPEL Processes. In B. Benatallah, F. Casati, and P. Traverso, editors, ICSOC, volume 3826 of Lecture Notes in Computer Science, pages 269-282. Springer, 2005.
  8. J. Bengtsson, K. G. Larsen, F. Larsson, P. Pettersson, and W. Yi. UPPAAL -a Tool Suite for Automatic Verification of Real-Time Systems. In Proc. of Workshop on Verifica- tion and Control of Hybrid Systems III, number 1066 in Lec- ture Notes in Computer Science, pages 232-243. Springer- Verlag, October 1995.
  9. E. M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstraction refinement. In CAV'00: Proceedings of the 12th International Conference on Com- puter Aided Verification, pages 154-169, London, UK, 2000. Springer-Verlag.
  10. E. M. Clarke, O. Grumberg, and D. A. Peled. Model check- ing. MIT Press, Cambridge, MA, USA, 1999.
  11. R. Cleaveland, J. Parrow, and B. Steffen. The concurrency workbench: A semantics-based tool for the verification of concurrent systems. ACM Transactions on Programming Languages and Systems, 15(1):36-72, January 1993.
  12. E. A. Emerson and A. P. Sistla. Symmetry and model check- ing. Formal Methods in System Design, 9(1-2):105-131, 1996.
  13. H. Foster, S. Uchitel, J. Magee, and J. Kramer. Model-based Verification of Web Service Compositions. In 18th IEEE In- ternational Conference on Automated Software Engineering (ASE 2003) , pages 152-163. IEEE Computer Society, 2003.
  14. X. Fu, T. Bultan, and J. Su. Analysis of interacting BPEL web services. In WWW '04: Proceedings of the 13th in- ternational conference on World Wide Web, pages 621-630, New York, NY, USA, 2004. ACM Press.
  15. X. Fu, T. Bultan, and J. Su. WSAT: A Tool for Formal Anal- ysis of Web Services. In Computer Aided Verification, 16th International Conference, CAV 2004, Proceedings, volume 3114 of Lecture Notes in Computer Science, pages 510-514. Springer, 2004.
  16. P. Godefroid. Using partial orders to improve automatic ver- ification methods. In CAV '90: Proceedings of the 2nd Inter- national Workshop on Computer Aided Verification, pages 176-185, London, UK, 1991. Springer-Verlag.
  17. S. Graf and H. Saidi. Construction of abstract state graphs with pvs. In CAV '97: Proceedings of the 9th International Conference on Computer Aided Verification, pages 72-83, London, UK, 1997. Springer-Verlag.
  18. C. L. Heitmeyer, R. D. Jeffords, and B. G. Labaw. A bench- mark for comparing different approaches for specifying and verifying real-time systems. In Proc. Tenth Intern. Work- shop on Real-Time Operating Systems and Software. IEEE Computer Society Press, may 1993.
  19. T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Lazy abstraction. In Symposium on Principles of Programming Languages, pages 58-70, 2002.
  20. G. J. Holzmann. The model checker SPIN. Software Engi- neering, 23(5):279-295, 1997.
  21. H. Huang, W.-T. Tsai, R. Paul, and Y. Chen. Automated Model Checking and Testing for Composite Web Services. In 8th IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2005), pages 300-307. IEEE Computer Society, 2005.
  22. M. Koshkina and F. van Breugel. Verification of Business Processes for Web Services. Technical Report CS-2003-11, York University -Department of Computer Science, 4700
  23. G. T. Leavens, A. L. Baker, and C. Ruby. JML: A no- tation for detailed design. In H. Kilov, B. Rumpe, and I. Simmonds, editors, Behavioral Specifications of Busi- nesses and Systems, pages 175-188. Kluwer Academic Pub- lishers, Boston, 1999.
  24. F. Leymann. Web Services Flow Language (WSFL) 1.1., 2001.
  25. S. Nakajima. Verification of Web Service Flows with model checking techniques. In CW '02: Proceedings of the First International Symposium on Cyber Worlds (CW'02), page 0378, Washington, DC, USA, 2002. IEEE Computer Soci- ety.
  26. S. Nakajima. Model-Checking Behavioral Specification of BPEL Applications. In Proceedings of the International Workshop on Web Languages and Formal Methods, WLFM 2005, 2005.
  27. F. Nielson, H. R. Nielson, and C. Hankin. Principles of Pro- gram Analysis. Springer-Verlag New York, Inc., Secaucus, NJ, USA, 1999.
  28. G. Puyz, Z. Xiangpengy, W. Shulingy, and Q. ZongyanyS. Towards the Semantics and Verification of BPEL4WS. In Proceedings of the International Workshop on Web Lan- guages and Formal Methods, WLFM 2005, 2005.
  29. Robby, M. B. Dwyer, and J. Hatcliff. Bogor: an extensible and highly-modular software model checking framework. In ESEC/FSE-11, pages 267-276, 2003.
  30. Robby, M. B. Dwyer, J. Hatcliff, and R. Iosif. Space- reduction strategies for model checking dynamic systems. In Proceeding of the 2003 Workshop on Software Model Check- ing, volume 89 of Electronic Notes in Theoretical Computer Science. Elsevier, July 2003.
  31. B.-H. Schlingloff, A. Martens, and K. Schmidt. Modeling and Model Checking Web Services. Electronic Notes in Theoretical Computer Science: Issue on Logic and Com- munication in Multi-Agent Systems, 126:3-26, March 2005.
  32. K. Schmidt. LoLA: A low level analyser. In M. Nielsen and D. Simpson, editors, Application and Theory of Petri Nets, 21st International Conference (ICATPN 2000), vol- ume 1825 of Lecture Notes in Computer Science, pages 465- 474. Springer-Verlag, June 2000.
  33. W3C. Web Services Description Language (WSDL) 1.1, 2003. http://www.w3.org/TR/wsdl.

Related papers

CTL Model Checking of Web Services Composition based on Open Workflow Nets Modeling
Rawand Guerfel

International Journal of Service Science, Management, Engineering, and Technology, 2016

Web services composition (WSC) has an enormous potential for the organizations in the B2B area. In fact, different services collaborate through the exchange of messages to implement complex business processes. BPEL is one of the most used languages to develop such cooperation. However, it has been proved that its use is complex and can require some expertise in XML syntax. Even its graphical representation is not evident to handle. This is why the authors propose to model Web services using oWF-nets, a subclass of Petri nets, and then, to translate them to BPEL. Whilst, a WSC is with added value only if the involved services are compatible. So in this context, across the translation proposed the researchers develop a verification layer of the WSC compatibility. Hence, they propose a framework named D&A4WSC which allows to model the WSC by oWF-nets, to check their compatibility with the model checker NuSMV and to translate them if they are compatible in BPEL processes using the oWFN2...

View PDFchevron_right
Formal Verification of BPEL4WS Business Collaborations
Jesús Arias Fisteus

E-Commerce and Web …, 2004

View PDFchevron_right
Modeling and formal verification framework of Web services composition
Kamel Barkaoui

2013

Abstract: To ensure reliable and efficient communication in B2B environments, we relied on the use of composite Web services. Indeed, in some cases, a service cannot provide the functionality required by the user unless it communicates with other services. This leads to the notion of Web services composition. The communication of these Web services has to be guaranteed without errors such as deadlocks. In this way, formal verification of Web services composition is a focused-on research field. It is in this context that our work is proposed. We have developed a tool for modeling and formal verification of Web services composition which is based on the modeling of these services by open workflow nets: a special class of Petri nets used to model business processes which communicate together via interface places. This tool checks temporal properties written in CTL against a WSC model translated into SMV code. The verification is ensured by invoking the NuSMV Model Checker.

View PDFchevron_right
Towards Automated Verification of Web Services
Cátia Vaz

2007

This paper proposes the use of model-checking software technology for the verification of workflows and business processes behaviour based on web services, namely the use of the SPIN model checker. Since the specification of a business process behaviour based on web services can be decomposed into patterns, it is proposed a translation of a well known collection of workflow patterns into PROMELA, the input specification language of SPIN. The use of this translation is illustrated with one business process example, which demonstrates how its translation to a PROMELA model can be useful in the web service specification and verification.

View PDFchevron_right
Applying Model Checking to BPEL4WS Business Collaborations
Jesús Arias Fisteus

Proceedings of the 2005 …, 2005

View PDFchevron_right

Related topics

  • Computer Science
  • Service Oriented Computing
  • Formal Verification
  • Specification Language
    • 580 California St., Suite 400
    San Francisco, CA, 94104
    © 2025 Academia. All rights reserved