Skip to main content
SpringerLink
Log in

Probabilistic Model Checking of BPMN Processes at Runtime

  • Conference paper
  • First Online:
Integrated Formal Methods (IFM 2022)

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

Included in the following conference series:

Abstract

Business Process Model and Notation (BPMN) is a standard business process modelling language that allows users to describe a set of structured tasks, which results in a service or product. Before running a BPMN process, the user often has no clear idea of the probability of executing some task or specific combination of tasks. This is, however, of prime importance for adjusting resources associated with tasks and thus optimising costs. In this paper, we define an approach to perform probabilistic model checking of BPMN models at runtime. To do so, we first transform the BPMN model into a Labelled Transition System (LTS). Then, by analysing the execution traces obtained when running multiple instances of the process, we can compute the probability of executing each transition in the LTS model, and thus generate a Probabilistic Transition System (PTS). Finally, we perform probabilistic model checking for verifying that the PTS model satisfies a given probabilistic property. This verification loop is applied periodically to update the results according to the execution of the process instances. All these steps are implemented in a tool chain, which was applied successfully to several realistic BPMN processes.

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 64.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 84.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.

    A final state is a state without outgoing transitions. If an LTS exhibits several final states, these states can be merged into a single one, resulting into an LTS strongly bisimilar [22] to the original one.

References

  1. Activiti: open source business automation. https://www.activiti.org/. Accessed Dec 2021

  2. Ceballos, H.G., Cantu, F.J.: Discovering causal relations in semantically-annotated probabilistic business process diagrams. In: Global Conference on Artificial Intelligence, GCAI, pp. 29–40 (2018)

    Google Scholar 

  3. Ceballos, H.G., Flores-Solorio, V., Garcia, J.P.: A probabilistic BPMN normal form to model and advise human activities. In: Baldoni, M., Baresi, L., Dastani, M. (eds.) EMAS 2015. LNCS (LNAI), vol. 9318, pp. 51–69. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-26184-3_4

    Chapter  Google Scholar 

  4. Durán, F., Rocha, C., Salaün, G.: Stochastic analysis of BPMN with time in rewriting logic. Sci. Comput. Program. 168, 1–17 (2018)

    Article  Google Scholar 

  5. Durán, F., Rocha, C., Salaün, G.: Analysis of resource allocation of BPMN processes. In: Yangui, S., Bouassida Rodriguez, I., Drira, K., Tari, Z. (eds.) ICSOC 2019. LNCS, vol. 11895, pp. 452–457. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-33702-5_35

    Chapter  Google Scholar 

  6. Emerson, E.A., Lei, C.L.: Efficient model checking in fragments of the propositional mu-calculus (extended abstract). In: LICS (1986)

    Google Scholar 

  7. Falcone, Y., Salaün, G., Zuo, A.: Semi-automated modelling of optimized BPMN processes. In: Proceedings of SCC 2021, pp. 425–430. IEEE (2021)

    Google Scholar 

  8. Garavel, H., Lang, F.: SVL: a scripting language for compositional verification. In: Kim, M., Chin, B., Kang, S., Lee, D. (eds.) Proceedings of FORTE 2001. IFIP Conference Proceedings, vol. 197, pp. 377–394. Kluwer (2001)

    Google Scholar 

  9. Garavel, H., Lang, F., Mateescu, R., Serwe, W.: CADP 2011: a toolbox for the construction and analysis of distributed processes. Int. J. Softw. Tools Technol. Transf. 15(2), 89–107 (2013). https://doi.org/10.1007/s10009-012-0244-z

    Article  MATH  Google Scholar 

  10. Garavel, H., Lang, F., Serwe, W.: From LOTOS to LNT. In: Katoen, J.-P., Langerak, R., Rensink, A. (eds.) ModelEd, TestEd, TrustEd. LNCS, vol. 10500, pp. 3–26. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-68270-9_1

    Chapter  Google Scholar 

  11. Hérault, T., Lassaigne, R., Magniette, F., Peyronnet, S.: Approximate probabilistic model checking. In: Steffen, B., Levi, G. (eds.) VMCAI 2004. LNCS, vol. 2937, pp. 73–84. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-24622-0_8

    Chapter  MATH  Google Scholar 

  12. Herbert, L., Sharp, R.: Precise quantitative analysis of probabilistic business process model and notation workflows. J. Comput. Inf. Sci. Eng. 13(1), 011007 (2013)

    Google Scholar 

  13. Herbert, L.T., Sharp, R.: Quantitative analysis of probabilistic BPMN workflows. In: International Design Engineering Technical Conferences and Computers and Information in Engineering Conference, vol. 45011, pp. 509–518. American Society of Mechanical Engineers (2012)

    Google Scholar 

  14. Herbert, L.T., Hansen, Z.N.L., Jacobsen, P.: Automated evolutionary restructuring of workflows to minimise errors via stochastic model checking. In: Probabilistic Safety Assessment and Management Conference 2014 (2014)

    Google Scholar 

  15. ISO/IEC: International standard 19510, information technology - business process model and notation (2013)

    Google Scholar 

  16. Krishna, A., Poizat, P., Salaün, G.: VBPMN: automated verification of BPMN processes (tool paper). In: Polikarpova, N., Schneider, S. (eds.) IFM 2017. LNCS, vol. 10510, pp. 323–331. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-66845-1_21

    Chapter  Google Scholar 

  17. Krishna, A., Poizat, P., Salaün, G.: Checking business process evolution. Sci. Comput. Program. 170, 1–26 (2019)

    Article  Google Scholar 

  18. Larsen, K.G., Skou, A.: Bisimulation through probabilistic testing. Inf. Comput. 94(1), 1–28 (1991)

    Article  MathSciNet  Google Scholar 

  19. Mateescu, R., Requeno, J.I.: On-the-fly model checking for extended action-based probabilistic operators. Int. J. Softw. Tools Technol. Transfer 20(5), 563–587 (2018). https://doi.org/10.1007/s10009-018-0499-0

    Article  MATH  Google Scholar 

  20. Mateescu, R., Salaün, G., Ye, L.: Quantifying the parallelism in BPMN processes using model checking. In: The 17th International ACM Sigsoft Symposium on Component-Based Software Engineering (CBSE 2014), Lille, France, June 2014

    Google Scholar 

  21. Mateescu, R., Thivolle, D.: A model checking language for concurrent value-passing systems. In: Cuellar, J., Maibaum, T., Sere, K. (eds.) FM 2008. LNCS, vol. 5014, pp. 148–164. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-68237-0_12

    Chapter  Google Scholar 

  22. Milner, R.: Communication and Concurrency. Prentice Hall, Upper Saddle River (1989)

    MATH  Google Scholar 

  23. Poizat, P., Salaün, G., Krishna, A.: Checking business process evolution. In: Kouchnarenko, O., Khosravi, R. (eds.) FACS 2016. LNCS, vol. 10231, pp. 36–53. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-57666-4_4

    Chapter  Google Scholar 

Download references

Acknowledgements

This work was supported by the Région Auvergne-Rhône-Alpes within the “Pack Ambition Recherche” programme, the H2020-ECSEL-2018-IA call - Grant Agreement number 826276 (CPS4EU), the French ANR project ANR-20-CE39-0009 (SEVERITAS), and LabEx PERSYVAL-Lab (ANR-11-LABX-0025-01).

Author information

Authors and Affiliations

  1. Univ. Grenoble Alpes, CNRS, Grenoble INP, Inria, LIG, 38000, Grenoble, France

    Yliès Falcone, Gwen Salaün & Ahang Zuo

Authors
  1. Yliès Falcone
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gwen Salaün
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ahang Zuo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ahang Zuo .

Editor information

Editors and Affiliations

  1. ISTI-CNR, Pisa, Italy

    Maurice H. ter Beek

  2. Maynooth University, Maynooth, Ireland

    Rosemary Monahan

Rights and permissions

Reprints and permissions

Copyright information

© 2022 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Falcone, Y., Salaün, G., Zuo, A. (2022). Probabilistic Model Checking of BPMN Processes at Runtime. In: ter Beek, M.H., Monahan, R. (eds) Integrated Formal Methods. IFM 2022. Lecture Notes in Computer Science, vol 13274. Springer, Cham. https://doi.org/10.1007/978-3-031-07727-2_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-07727-2_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-07726-5

  • Online ISBN: 978-3-031-07727-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation