Skip to main content
SpringerLink
Log in

Specification and Verification of Complex Business Processes - A High-Level Petri Net-Based Approach

  • Conference paper
  • First Online:
Business Process Management (BPM 2016)

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

Included in the following conference series:

Abstract

The Business Process Modeling Notation (BPMN) has been widely used as a tool for business process modeling. However, BPMN suffers from a lack of standard formal semantics. This weakness can lead to inconsistencies, ambiguities, and incompletenesses within the developed models. In this paper we propose a formal semantics of BPMN using recursive ECATNets. Owing to this formalism, a large set of BPMN features such cancellation, multiple instantiation of subprocesses and exception handling can be covered while taking into account the data flow aspect. The benefits and usefulness of this modelling are illustrated through two examples. Moreover, since recursive ECATNets semantics is expressed in terms of conditional rewriting logic, one can use the Maude LTL model checker to verify several behavioral properties related to BPMN models.

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. Barkaoui, K., Hicheur, A.: Towards analysis of flexible and collaborative workflow using recursive ECATNets. In: ter Hofstede, A.H.M., Benatallah, B., Paik, H.-Y. (eds.) BPM Workshops 2007. LNCS, vol. 4928, pp. 232–244. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  2. Barkaoui, K., Boucheneb, H., Hicheur, A.: Modelling and analysis of time-constrained flexible workflows with time recursive ECATNet. In: Bruni, R., Wolf, K. (eds.) Web Services and Formal Methods. LNCS, vol. 5387, pp. 19–36. Springer, Berlin Heidelberg (2008)

    Chapter  Google Scholar 

  3. Hicheur, A.: Modélisation et Analyse des Processus Workflows Reconfigurables et Distribués par les ECATNets Récursifs. Ph.D. dissertation. CEDRIC-CNAM, Paris (2009)

    Google Scholar 

  4. Billington, J., Christensen, S., van Hee, K.M., Kindler, E., Kummer, O., Petrucci, L., Post, R., Stehno, C., Weber, M.: The petri net markup language: concepts, technology, and tools. In: van der Aalst, W.M.P., Best, E. (eds.) ICATPN 2003. LNCS, vol. 2679, pp. 483–505. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  5. Dijkman, R.M., Dumas, M., Ouyang, C.: Semantics and Analysis of Business Process Models in BPMN. Information and Software Technology 50(12), 1281–1294 (2008)

    Article  MATH  Google Scholar 

  6. Dufourd, C., Finkel, A., Schnoebelen, P.: Reset nets between decidability and undecidability. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 103–115. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  7. Eker, S., Meseguer, J., Sridharanarayanan, A.: The Maude LTL Model Checker. Electronic Notes in Theoretical Computer Science 71, 162–187 (2004)

    Article  Google Scholar 

  8. Haddad, S., Poitrenaud, D.: Recursive Petri nets - Theory and application to discrete event systems. Acta Informatica 44(7–8), 463–508 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  9. Jouault, F., Allilaire, F., Bzivin, J., Kurtev, I.: ATL : A model transformation tool. Science of Computer Programming (EST) 72(1–2), 31–39 (2008). Special Issue on Second issue of experimental software and toolkits

    Article  MATH  Google Scholar 

  10. Meseguer, J.: Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science 96(1), 73–155 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  11. Morimoto, S.: A survey of formal verification for business process modeling. In: Bubak, M., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds.) ICCS 2008, Part II. LNCS, vol. 5102, pp. 514–522. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  12. O. M. G. (OMG). Business Process Model and Notation (BPMN), Version 2.0. Technical report, January 2011

    Google Scholar 

  13. Ou-Yang, C., Lin, Y.D.: BPMN-based business process model feasibility analysis: a Petri net approach. International Journal of Production Research 46(14), 3763–3781 (2008)

    Article  Google Scholar 

  14. Ouyang, C., Verbeek, E., van der Aalst, W.M.P., Breutel, S., Dumas, M., ter Hofstede, A.H.M.: WofBPEL: A tool for automated analysis of BPEL processes. In: Benatallah, B., Casati, F., Traverso, P. (eds.) ICSOC 2005. LNCS, vol. 3826, pp. 484–489. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  15. Russell, N., ter Hofstede, A., van der Aalst, W., Mulyar, N.: Workflow Control-Flow Patterns: A Revised View. Technical report, BPM Center (2006)

    Google Scholar 

  16. van der Aalst, W., ter Hofstede, A.: YAWL: Yet Another Workflow Language. Information Systems 30(4), 245–275 (2005)

    Article  Google Scholar 

  17. Verbeek, H.M.W.E., van der Aalst, W.M.P.: Woflan 2.0 A petri-net-based workflow diagnosis tool. In: Nielsen, M., Simpson, D. (eds.) ICATPN 2000. LNCS, vol. 1825, pp. 475–484. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  18. Ye, J., Sun, S., Song, W., Wen, L.: Formal semantics of BPMN process models using YAWL. In: Second International Symposium on Intelligent Information Technology Application (IITA), vol. 2, pp. 70–74, December 2008

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. MOVEP, Computer Science Department, USTHB, Algiers, Algeria

    Ahmed Kheldoun & Malika Ioualalen

  2. CEDRIC-CNAM, 292 Rue Saint-Martin, 75141, Cedex 03, Paris, France

    Kamel Barkaoui

Authors
  1. Ahmed Kheldoun
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kamel Barkaoui
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Malika Ioualalen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ahmed Kheldoun .

Editor information

Editors and Affiliations

  1. IBM Almaden Research Center, San Jose, California, USA

    Hamid Reza Motahari-Nezhad

  2. Queensland University, Brisbane, Queensland, Australia

    Jan Recker

  3. Humboldt-Universität zu Berlin, Berlin, Germany

    Matthias Weidlich

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Kheldoun, A., Barkaoui, K., Ioualalen, M. (2015). Specification and Verification of Complex Business Processes - A High-Level Petri Net-Based Approach. In: Motahari-Nezhad, H., Recker, J., Weidlich, M. (eds) Business Process Management. BPM 2016. Lecture Notes in Computer Science(), vol 9253. Springer, Cham. https://doi.org/10.1007/978-3-319-23063-4_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-23063-4_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-23062-7

  • Online ISBN: 978-3-319-23063-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation