Skip to main content
Springer Nature Link
Log in

Hierarchical Process Verification in a Semi-trusted Environment

  • Conference paper
On the Move to Meaningful Internet Systems: OTM 2012 (OTM 2012)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7565))

  • 1583 Accesses

Abstract

In a business collaboration different parties work together to create a compositional process that incorporates internal processes of the participants to achieve a common goal. It must be assured that certain requirements, such as legal regulations, are fulfilled by the overall composition. Verification of such requirements requires knowledge about the internal functionalities of the involved parties, who in turn do not want to reveal their processes. This work presents a technique for hierarchical verification of the requirements over the process composition based on the guarantees, called property assertions, provided by the collaboration participants.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Van der Aalst, W.M.P.: Verification of Workflow Nets. In: Azéma, P., Balbo, G. (eds.) ICATPN 1997. LNCS, vol. 1248, pp. 407–426. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  2. Beckert, B., et al.: Intelligent Systems and Formal Methods in Software Engineering. IEEE Intelligent Systems 21(6), 71–81 (2006)

    Article  Google Scholar 

  3. Biere, A., Biere, A., Heule, M., van Maaren, H., Walsh, T.: Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol. 185. IOS Press, Amsterdam (2009)

    MATH  Google Scholar 

  4. van Breugel, F., Koshkina, M.: Models and Verification of BPEL (2006), http://www.cse.yorku.ca/~franck/research/drafts/tutorial.pdf

  5. Fadlisyah, M.: Using the π-calculus for modeling and verifying processes on web services. Master’s thesis, Insitute for Theoretical Computer Science, Dresden University of Technology (2004)

    Google Scholar 

  6. Fahland, D., Reisig, W.: ASM-based semantics for BPEL: The negative control flow. In: 12th International Workshop on Abstract State Machines, pp. 131–151 (March 2005)

    Google Scholar 

  7. Foster, H., Uchitel, S., Magee, J., Kramer, J.: A Model-Based Approach to Engineering Web Service Compositions and Choreography in Test and Analysis of Web Services. In: Baresi, L., Di Nitto, E. (eds.), ch. 71-91, pp. 72–91. Springer-Verlag Berlin and Heidelberg GmbH & Co. (2007)

    Google Scholar 

  8. Giblin, C., Liu, A.Y., Müller, S., Pfitzmann, B., Zhou, X.: Regulations expressed as logical models (realm). In: JURIX, pp. 37–48 (2005)

    Google Scholar 

  9. Hinz, S., Schmidt, K., Stahl, C.: Transforming BPEL to Petri Nets. In: van der Aalst, W.M.P., Benatallah, B., Casati, F., Curbera, F. (eds.) BPM 2005. LNCS, vol. 3649, pp. 220–235. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  10. Lohmann, N., Massuthe, P., Stahl, C., Weinberg, D.: Analyzing Interacting BPEL Processes. In: Dustdar, S., Fiadeiro, J.L., Sheth, A.P. (eds.) BPM 2006. LNCS, vol. 4102, pp. 17–32. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  11. Lohmann, N., Massuthe, P., Wolf, K.: Behavioral Constraints for Services. In: Alonso, G., Dadam, P., Rosemann, M. (eds.) BPM 2007. LNCS, vol. 4714, pp. 271–287. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  12. Lucchia, R., Mazzara, M.: A pi-calculus based semantics for ws-bpel. Journal of Logic and Algebraic Programming 70(1), 96–118 (2007)

    Article  MathSciNet  Google Scholar 

  13. Microsoft Research. Z3 an efficient theorem prover, http://research.microsoft.com/en-us/um/redmond/projects/z3/

  14. Monakova, G., et al.: Verifying Business Rules Using an SMT Solver for BPEL Processes. In: BPSC (2009)

    Google Scholar 

  15. Monakova, G., Leymann, F.: Workflow art: A framework for multidimensional workflow analysis. In: Enterprise Information Systems (2012)

    Google Scholar 

  16. Nelson, G., Oppen, D.: Simplification by Cooperating Decision Procedures. ACM Transactions on Programming Languages and Systems 1(2), 245–257 (1979)

    Article  MATH  Google Scholar 

  17. OASIS. Web Services Business Process Execution Language Version 2.0 (2007)

    Google Scholar 

  18. Pesic, M., Schonenberg, M.H., Sidorova, N., van der Aalst, W.M.P.: Constraint-Based Workflow Models: Change Made Easy. In: Meersman, R., Tari, Z. (eds.) OTM 2007, Part I. LNCS, vol. 4803, pp. 77–94. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  19. van der Aalst, W.M.P., Pesic, M.: DecSerFlow: Towards a Truly Declarative Service Flow Language. In: Bravetti, M., Núñez, M., Zavattaro, G. (eds.) WS-FM 2006. LNCS, vol. 4184, pp. 1–23. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. SAP Research Karlsruhe, Vincenz-Priessnitz-Str. 1, 76131, Karlsruhe, Germany

    Ganna Monakova

Authors
  1. Ganna Monakova
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Semantic Technology and Application Research Laboratory (STARLab), Vrije Universiteit Brussel, Building G-10, Pleinlaan 2, 1050, Brussels, Belgium

    Robert Meersman

  2. Research Centre for Automatic Control, School of Engineering in Information Technology, University of Lorraine, CNRS, Campus scientifique, BP 70239, 54506, Vandoeuvre-les-Nancy, France

    Hervé Panetto

  3. La Trobe University, Melbourne, VIC, Australia

    Tharam Dillon

  4. Faculty of Computer Science, University of Vienna, 1010, Vienna, Austria

    Stefanie Rinderle-Ma

  5. Institute of Databases and Information Systems, Ulm University, Germany

    Peter Dadam

  6. School of Information Technology and Electrical Engineering, University of Queensland, 4072, Brisbane, QLD, Australia

    Xiaofang Zhou

  7. HP Labs, Bristol, UK

    Siani Pearson

  8. Johannes Kepler University, Linz, Austria

    Alois Ferscha

  9. Università di Modena e Reggio Emilia, Modena, Italy

    Sonia Bergamaschi

  10. ADVIS Lab, Department of Computer Science, University of Illinois at Chicago, Chicago, IL, USA

    Isabel F. Cruz

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Monakova, G. (2012). Hierarchical Process Verification in a Semi-trusted Environment. In: Meersman, R., et al. On the Move to Meaningful Internet Systems: OTM 2012. OTM 2012. Lecture Notes in Computer Science, vol 7565. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33606-5_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33606-5_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33605-8

  • Online ISBN: 978-3-642-33606-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics