Skip to main content
SpringerLink
Log in

Formal Verification of e-Services and Workflows

  • Conference paper
  • First Online:
Web Services, E-Business, and the Semantic Web (WES 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2512))

Abstract

We study the verification problem for e-service (and workflow) specifications, aiming at efficient techniques for guiding the construction of composite e-services to guarantee desired properties (e.g., deadlock avoidance, bounds on resource usage, response times). Based on e-service frameworks such as AZTEC and e-FLow, decision flow language Vortex, we introduce a very simple e-service model for our investigation of verification issues. We first show how three different model checking techniques are applied when the number of processes is limited to a predetermined number. We then introducepid quantified constraint, a new symbolic representation that can encode infinite many system states, to verify systems with unbounded and dynamic process instantiations. We think that it is a versatile technique and more suitable for verification of e-service specifications. If this is combined with other techniques such as abstraction and widening, it is possible to solve a large category of interesting verification problems for e-services.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Alur, T. A. Henzinger, and P. Ho. Automatic symbolic verification of embedded systems. IEEE Transactions on Software Engineering, 22(3): 181–201, March 1996.

    Google Scholar 

  2. T. Bultan. Action language: A specification language for model checking reactive systems. In Proceedings of the 22nd International Conference on Software Engineering (ICSE 2000), pages 335–344, June 2000.

    Google Scholar 

  3. T. Bultan, R. Gerber, and W. Pugh. Model-checking concurrent systems with unbounded integer variables: Symbolic representations, approximations, and experimental results. ACM Transactions on Programming Languages and Systems, 21(4):747–789, July 1999.

    Google Scholar 

  4. J. Burch, E. Clarke, K. McMillan, D. Dill, and L. Hwang. Symbolic model checking: 1020 states and beyond. In IEEE Symposium on Logic in Computer Science, pages 428–439, 1990.

    Google Scholar 

  5. F. Casati and M.-C. Shan. Dynamic and adaptive composition of e-services. Information Systems, 26(3):143–163, 2001.

    Article  MATH  Google Scholar 

  6. V. Christophides, R. Hull, G. Karvounarakis, A. Kumar, G. Tong, and M. Xiong. Beyond discrete e-services: Composing session-oriented services in telecommunications. In Proc. of Workshop on Technologies for E-Services (TES), Rome, Italy, Sept. 2001.

    Google Scholar 

  7. E. M. Clarke and E. A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In D. Kozen, editor, Logic of Programs: Workshop, volume 131 of Lecture Notes in Computer Science. Springer-Verlag, May 1981.

    Google Scholar 

  8. H. Davulcu, M. Kifer, C.R. Ramakrishnan, and I.V. Ramakrishnan. Logic based modeling and analysis. Inpods, 1998.

    Google Scholar 

  9. G. Delzanno. Automatic verification of parameterized cache coherence protocols. In Proceedings of the 12th International Conference on Computer Aided Verification, volume 1855 of Lecture Notes in Computer Science, pages 53–68. Springer-Verlag, 2000.

    Chapter  Google Scholar 

  10. G. Delzanno and T. Bultan. Constraint-based verification of client-server protocols. In Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming, 2001.

    Google Scholar 

  11. M. C. Fauvet, M. Dumas, B. Benatallah, and H. Y. Paik. Peer-to-peer traced execution of composite services. In Proc. ofWorkshop on Technologies for E-Services (TES), Rome, Italy, Sept. 2001.

    Google Scholar 

  12. X. Fu, T. Bultan, R. Hull, and J. Su. Verification of vortex workflows. In Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, volume 2031 of Lecture Notes in Computer Science, pages 143–157. Springer-Verlag, April 2001.

    Chapter  Google Scholar 

  13. X. Fu, T. Bultan, and J. Su. Hybrid predicate abstraction for verification of workflow and decision flow systems. Technical report, Computer Science Department, UCSB, January 2002.

    Google Scholar 

  14. M. Gillmann, J. Weissenfels, G. Weikum, and A. Kraiss. Performance and availability assessment for the configuration of distributed workflow management systems. In Proceedings of the 7th International Conference on Extending Database Technology, LNCS 1777, pages 183–202, 2000.

    Google Scholar 

  15. P. Godefroid and D. Pirottin. Refining dependencies improves partial-order verification methods. In Proceedings of the 2nd Workshop on Computer Aided Verification, LNCS 697, pages 438–449, 1993.

    Google Scholar 

  16. N. Halbwachs, P. Raymond, and Y. Proy. Verification of linear hybrid systems by means of convex approximations. In B. LeCharlier, editor, Proceedings of International Symposium on Static Analysis, volume 864 of Lecture Notes in Computer Science, Springer-Verlag, September 1994.

    Google Scholar 

  17. G. J. Holzmann. The model checker SPIN. IEEE Transactions on Software Engineering, 23(5):279–295, May 1997.

    Google Scholar 

  18. R. Hull, F. Llirbat, E. Simon, J. Su, G. Dong, B. Kumar, and G. Zhou. Declarative workflows that support easy modification and dynamic browsing. In Proc. Int. Joint Conf. on Work Activities Coordination and Collaboration, 1999.

    Google Scholar 

  19. W. Kelly, V. Maslov, W. Pugh, E. Rosser, T. Shpeisman, and D. Wonnacott. The Omega library interface guide. Technical Report CS-TR-3445, Department of Computer Science, University of Maryland, College Park, March 1995.

    Google Scholar 

  20. A. Kraiss, F. Schön, G. Weikum, and U. Deppisch. Towards response time guarantees for e-service middleware. IEEE Data Engineering Bulletin, 24(1):58–63, 2001.

    Google Scholar 

  21. K. L. McMillan. Symbolic model checking. Kluwer Academic Publishers, Massachusetts, 1993.

    MATH  Google Scholar 

  22. P. Muth, D. Wodtke, J. Weissenfels, G. Weikum, and A. Kotz-Dittrich. Enterprise-wide workflow management based on state and activity charts. In Proc. NATO Advanced Study Institute on Workflow Management Systems and Interoperability, 1997.

    Google Scholar 

  23. D. C. Oppen. A 22 2 2 pn upper bound on the complexity of Presburger arithmetic. Journal of Computer and System Sciences, 16:323–332, 1978.

    Article  MATH  MathSciNet  Google Scholar 

  24. A. Pnueli. The temporal semantics of concurrent programs. In Proceedings of the 18th Symposium on Foundations of Computer Science, 1977.

    Google Scholar 

  25. A. Pnueli. The temporal semantics of concurrent programs. Theoretical Computer Science, 13:45–60, 1981.

    Article  MATH  MathSciNet  Google Scholar 

  26. R.E. Bryant. Graph-based algorithms for boolean function manipulation. In Proceedings of the 27th ACM/IEEE Design Automation Conference, 1986.

    Google Scholar 

  27. H. Saidi. Model checking guided abstraction and analysis. In Proceedings of Statica Analysis Symposium, Lecture Notes in Computer Science. Springer, 2000.

    Google Scholar 

  28. M. Schroeder. Verification of business processes for a correspondence handling center using CCS. In Proc. European Symp. on Validation and Verification of Knowledge Based Systems and Components, June 1999.

    Google Scholar 

  29. W. M. P. van der Aalst. The application of petri nets to workflow management. Journal of Circuits, systems and computers, 8(1):21–26, 1998.

    Article  Google Scholar 

  30. W. M. P. van der Aalst and A. H. M. ter Hofstede. Verification of workflow task structures: A Petri-net-based approach. Information Systems, 25(1), 2000.

    Google Scholar 

  31. T. Yavuz-Kahveci, M. Tuncer, and T. Bultan. Composite symbolic library. In Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, volume 2031 of Lecture Notes in Computer Science, pages 335–344. Springer-Verlag, April 2001.

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of California at Santa Barbara, CA, 93106, USA

    Xiang Fu, Tevfik Bultan & Jianwen Su

Authors
  1. Xiang Fu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tevfik Bultan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jianwen Su
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Oracle Corporation, 500 Oracle Parkway, Redwood Shores, CA, 94065, USA

    Christoph Bussler

  2. Bell Labs, Lucent Technologies, 600 Mountain Avenue, Room 2D-510, Murray Hill, NJ, 07974, USA

    Richard Hull

  3. Department of Computer Science, Stanford University, Stanford, CA, 94305-9020, USA

    Sheila McIlraith

  4. School of Info. Technology and Elec. Engineering, The University of Queensland, Brisbane, Qld 4072, Australia

    Maria E. Orlowska

  5. Department of Electronic and Information Science, Politecnico di Milano, Piazza Leonardo da Vinci 32, 20133, Milan, Italy

    Barbara Pernici

  6. Infolab, Tilburg University, PO Box 90153, 5000, LE Tilburg, The Netherlands

    Jian Yang

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fu, X., Bultan, T., Su, J. (2002). Formal Verification of e-Services and Workflows. In: Bussler, C., Hull, R., McIlraith, S., Orlowska, M.E., Pernici, B., Yang, J. (eds) Web Services, E-Business, and the Semantic Web. WES 2002. Lecture Notes in Computer Science, vol 2512. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36189-8_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-36189-8_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00198-0

  • Online ISBN: 978-3-540-36189-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation