Skip to main content

Application of Formal Methods to Verify Business Processes

  • Conference paper
  • First Online:
Formal Methods: Foundations and Applications (SBMF 2016)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 10090))

Included in the following conference series:

Abstract

Formal specifications and modeling languages can be used to provide support for Business Process (BP) analysts and designers to verify the behavior of BPs with respect to business performance indicators (i.e., service time, waiting time or queue size). This article presents the application of the Timed Automata (TA) formal language to check BPs modeled with Business Process Model and Notation (BPMN) using the model checking verification technique. Also, a set of transformation rules and two algorithms are introduced to obtain TA-networks from BPMN models, allowing the formal specification of a BP-task model equivalent to the BPMN model. The approach presented here contributes to conduct the qualitative analysis of BPMN models.

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

Access this chapter

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 EPUB and 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

Notes

  1. 1.

    This example was taken from: http://www.visual-paradigm.com/tutorials/bpmn- tutorial-with-example.jsp.

  2. 2.

    We agree with [3] to specify a structured BPMN model as a process graph to conduct the transformation (presented in Sect. 4).

References

  1. Behrmann, G., David, A., Larsen, K.G.: A tutorial on Uppaal. In: Bernardo, M., Corradini, F. (eds.) SFM-RT 2004. LNCS, vol. 3185, pp. 200–236. Springer, Heidelberg (2004). doi:10.1007/978-3-540-30080-9_7

    Chapter  Google Scholar 

  2. Capel, M., Mendoza, L., Benghazi, K.: Automatic verification of business process integrity. Int. J. Simul. Process Model. 4(3/4), 167–182 (2008)

    Article  Google Scholar 

  3. Cheikhrouhou, S., Kallel, S., Guermouche, N., Jmaiel, M.: Enhancing formal specification and verification of temporal constraints in business processes. In: Proceedings of 2014 IEEE International Conference on Services Computing, SCC 2014, pp. 701–708. IEEE Computer Society, Washington (2014). http://dx.doi.org/10.1109/SCC.2014.97

  4. Cheikhrouhou, S., Kallel, S., Guermouche, N., Jmaiel, M.: The temporal perspective in business process modeling: a survey and research challenges. Serv. Oriented Comput. Appl. 9(1), 75–85 (2015). http://dx.doi.org/10.1007/s11761-014-0170-x

    Article  Google Scholar 

  5. Kossak, F., et al.: How the semantic model can be used. In: A Rigorous Semantics for BPMN 2.0 Process Diagrams, pp. 153–159. Springer International Publishing, Heidelberg (2014). http://dx.doi.org/10.1007/978-3-319-09931-6_5

    Google Scholar 

  6. Mallek, S., Daclin, N., Chapurlat, V., Vallespir, B.: Enabling model checking for collaborative process analysis: from BPMN to ‘Network of Timed Automata’. Enterp. Inf. Syst. 9(3), 279–299 (2015). http://dx.doi.org/10.1080/17517575.2013.879211

    Article  Google Scholar 

  7. Mendoza, L., Marius, A., Pérez, M., Grimán, A.: Critical success factors for a customer relationship management strategy. Inf. Softw. Technol. 49(8), 913–945 (2007)

    Article  Google Scholar 

  8. Morimoto, S.: A survey of formal verification for business process modeling. In: Bubak, M., Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds.) ICCS 2008. LNCS, vol. 5102, pp. 514–522. Springer, Heidelberg (2008). doi:10.1007/978-3-540-69387-1_58

    Chapter  Google Scholar 

  9. OMG: Business Process Model and Notation - v2.0. Object Management Group, Massachusetts (2011). http://www.omg.org/spec/BPMN/2.0/PDF

    Google Scholar 

  10. Paternò, F.: Task models in interactive software systems. In: Handbook of Software Engineering and Knowledge Engineering: Recent Advances. World Scientific Publishing Co., Inc., River Edge (2001)

    Google Scholar 

  11. Rüf, J., Kropf, T.: Symbolic model checking for a discrete clocked temporal logic with intervals. In: Proceedings of IFIP WG 10.5 International Conference on Correct Hardware Design and Verification Methods, pp. 146–163. Chapman & Hall Ltd, London (1997)

    Google Scholar 

  12. Watahiki, K., Ishikawa, F., Hiraishi, K.: Formal verification of business processes with temporal and resource constraints. In: 2011 IEEE International Conference on Systems, Man, and Cybernetics (SMC 2011), pp. 1173–1180. IEEE Computer Society, Los Alamitos (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Luis E. Mendoza Morales .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Mendoza Morales, L.E., Monsalve, C., Villavicencio, M. (2016). Application of Formal Methods to Verify Business Processes. In: Ribeiro, L., Lecomte, T. (eds) Formal Methods: Foundations and Applications. SBMF 2016. Lecture Notes in Computer Science(), vol 10090. Springer, Cham. https://doi.org/10.1007/978-3-319-49815-7_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-49815-7_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-49814-0

  • Online ISBN: 978-3-319-49815-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics