Skip to main content

Refactor Business Process Models with Redundancy Elimination

  • Conference paper
  • First Online:
Advances in Parallel & Distributed Processing, and Applications

Abstract

Since business processes are important assets, enterprises must be able to deal with their quality issues. Since understandability is one important quality criterion, a question arises here is how to improve the understandability of these models? In this paper, we propose a novel approach to refactor business process models represented as Petri nets with redundancy elimination for improving their understandability. More specifically, we first propose a process model smell for identifying redundant elements in a business process model using the unfolding technique, where the metric of this smell is an implicit place (IP). To avoid the state explosion problem caused by concurrency, we present a novel algorithm for computing an IP from the complete finite prefix unfolding (CFPU) rather than the reachability graph (RG) of a net system. Then, we propose three refactoring operations to eliminate an IP from the business process model without changing their external behavior. After refactoring, the size of the model is decreased such that the model is easier to be understood, that is, the understandability of the model can be improved. Experiments show our approach can eliminate IPs from business process models efficiently and preserve the behavior of these 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 299.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 379.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 379.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. L.J. Wen, J.M. Wang, W.M.P. van der Aalst, B.Q. Huang, Mining process models with prime invisible tasks. Data Knowl. Eng. 69(10), 999–1021 (2010)

    Article  Google Scholar 

  2. Q. Mo, W. Song, F. Dai, L. Lin, T. Li, Development of collaborative business processes: A correctness enforcement approach, IEEE Trans. Serv. Comput. (2019), https://doi.org/10.1109/TSC.2019.2961346

  3. X. Xu, X. Liu, Z. Xu, F. Dai, X. Zhang, L. Qi,“Trust-oriented IoT service placement for smart cities in edge computing,” IEEE Internet Things J. (2019), https://doi.org/10.1109/JIOT.2019.2959124.

  4. R. Laue, A. Gadatsch, A, “measuring the understandability of business process models - are we asking the right questions?”, in Business Process Management Workshops. BPM 2010. Lecture Notes in Business Information Processing, ed. by M. zur Muehlen, J. Su, vol. 66, (Springer, Berlin, Heidelberg, 2010), pp. 37–48

    Google Scholar 

  5. X. Xu, R. Mo, F. Dai, W. Lin, S. Wan, W. Dou, Dynamic Resource Provisioning with Fault Tolerance for Data-Intensive Meteorological Workflows in Cloud, IEEE Trans. Ind. Inf. (2019), https://doi.org/10.1109/TII.2019.2959258

  6. H. Leopold, J. Mendling, H.A. Reijers, M.L. Rosa, Simplifying process model abstraction: Techniques for generating model names. Inf. Syst. 39, 134–151 (2014)

    Article  Google Scholar 

  7. X. Xu, W. Dou, X. Zhang, J. Chen, EnReal: An energy-aware resource allocation method for scientific workflow executions in cloud environment. IEEE Trans. Cloud Comput. 4(2), 166–179 (2016)

    Article  Google Scholar 

  8. H. A. Reijers and J. Mendling, "A Study Into the factors that influence the understandability of business process models, IEEE Trans. Syst. Man Cybern. Part A Syst. Hum., 2011, vol. 41, no. 3, pp. 449–462

    Article  Google Scholar 

  9. R. Dijkman, B. Gfeller, J. Küster, H. Völzer, Identifying refactoring opportunities in process model repositories. Inf. Softw. Technol. 53(9), 937–948 (2011)

    Article  Google Scholar 

  10. B. Weber, M. Reichert, J. Mendling, H.A. Reijers, Refactoring large process model repositories. Comput. Ind. 62(5), 467–486 (2011)

    Article  Google Scholar 

  11. G. Salaün, T. Bultan, N. Roohi, Realizability of choreographies using process algebra encodings. IEEE Trans. Serv. Comput. 5(3), 90–302 (2012)

    Article  Google Scholar 

  12. T. Jin, J. Wang, Y. Yang, L. Wen, K. Li, Refactor business process models with maximized parallelism. IEEE Trans. Serv. Comput. 9(3), 456–468 (2016)

    Article  Google Scholar 

  13. W.M.P. van Aalst, T. Basten, Inheritance of workflows: An approach to tackling problems related to change. Theor. Comput. Sci. 270(1–2), 125–203 (2002)

    Article  MathSciNet  Google Scholar 

  14. J. Esparza, R. Stefan, V. Walter, An improvement of McMillan’s unfolding algorithm. Formal Methods Syst. Des. 20(3), 285–310 (2002)

    Article  Google Scholar 

  15. J.M. Colom, M. Silva, Improving the linearly based characterization of P/T nets, in Advances in Petri nets 1990, LNCS, vol. 483, (Springer Verlag, Berlin, Heidelberg, 1991), pp. 113–145

    Chapter  Google Scholar 

  16. J. Pei, L. Wen, X. Ye, A. Kumar, Z. Lin, “Transition adjacency relation computation based on unfolding: Potentials and challenges,” [C]// In: Proc of the OTM Confederated International Conferences “on the Move to Meaningful Internet Systems,” 2016, 61–79

    Google Scholar 

  17. C. Girault, R. Valk. Petri nets for systems engineering: A guide to modeling, verification, and applications[M] (2003)

    Google Scholar 

  18. T. Mens, T. Tourwe, A survey of software refactoring. IEEE Trans. Softw. Eng. 30(2), 126–139 (2004)

    Article  Google Scholar 

  19. N.J. Dingle, W.J. Knottenbelt, T. Suto, PIPE2: A tool for the performance evaluation of generalised stochastic Petri nets. Meas. Model. Comput. Syst. 36(4), 34–39 (2009)

    Google Scholar 

  20. J. Mendling, H.A. Reijers, J. Cardoso, What makes process models understandable? in Proc. the 5th International Conference on Business Process Management, (Springer (BPM 2007), Berlin, Heidelberg, 2007), pp. 48–63

    Chapter  Google Scholar 

  21. J. Mendling, H.A. Reijers, J. Recker, Activity labeling in process modeling: Empirical insights and recommendations. Inf. Syst. 35, 467–482 (2010)

    Article  Google Scholar 

  22. I. Vanderfeesten, H.A. Reijers, J. Mendling, W.M.P. van der Aalst, J. Cardoso, On a quest for good process models: The cross-connectivity metric, in Advanced Information Systems Engineering (CAiSE 2008).,” Lecture Notes in Computer Science, vol. 5074, (Springer, Berlin, Heidelberg, 2008), pp. 480–494

    Google Scholar 

  23. H. Leopold, C. Meilicke, M. Fellmann M, F. Pittke, H. Stuckenschmidt, J. Mendling, Towards the automated annotation of process models, in Proc of the International Conference on Advanced Information Systems Engineering. Springer International Publishing (2015), pp. 401–416

    Google Scholar 

  24. H. Leopold, S. Smirnov, J. Mendling, Refactoring of process model activity labels, in Proc of the International Conference on Application of Natural Language to Information Systems, (Springer, Berlin, Heidelberg, 2010), pp. 268–276

    Google Scholar 

Download references

Acknowledgments

This work was supported in part by the Project of National Natural Science Foundation of China under Grant No. 61702442, 61862065, and 61662085, the Application Basic Research Project in Yunnan Province Grant No. 2018FB105.

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Dai, F., Xue, H., Qiang, Z., Qi, L., Khosravi, M.R., Liang, Z. (2021). Refactor Business Process Models with Redundancy Elimination. In: Arabnia, H.R., et al. Advances in Parallel & Distributed Processing, and Applications. Transactions on Computational Science and Computational Intelligence. Springer, Cham. https://doi.org/10.1007/978-3-030-69984-0_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-69984-0_37

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-69983-3

  • Online ISBN: 978-3-030-69984-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics