Skip to main content

Pareto-Optimal Trace Generation from Declarative Process Models

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

Part of the book series: Lecture Notes in Business Information Processing ((LNBIP,volume 492))

Included in the following conference series:

  • 275 Accesses

Abstract

Declarative process models (DPMs) enable the description of business process models with a high level of flexibility by being able to describe the constraints that compliant traces must abide by. In this way, a well-formed declarative specification generates a family of compliant traces. However, little is known about the difference between different compliant traces, as the only criterion used for comparison is satisfiability. In particular, we believe that not all compliant traces are alike: some might be sub-optimal in their resource usage. In this work, we would like to support users of DPMs in the selection of compliant and optimal traces. In particular, we use Dynamic Condition Response (DCR) graphs as our language to represent DPMs, extending it with a parametric definition of costs linked to events. Multiple types of cost imply that different traces might be optimal, each according to a different cost dimension. We encode cost-effective finite trace generation as a Constraint Optimisation Problem (COP) and showcase the feasibility of the implementation via an implementation in MiniZinc. Our initial benchmarks suggest that the implementation is capable of providing answers efficiently for processes of varying size, number of constraints, and trace length.

J. F. Diaz, H. A. López, L. Quesada and J. C. Rosero—Alphabetical order, equal author contribution.

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

    https://github.com/JuanK120/dcrGraph.

  2. 2.

    https://github.com/JuanK120/dcrGraph/tree/master/Tests/Detailed.

References

  1. Pesic, M.: Constraint-based workflow management systems: shifting control to users. Ph.D. Dissertation, Industrial Engineering and Innovation Sciences (2008)

    Google Scholar 

  2. Burattin, A., Gianola, A., López, H.A., Montali, M.: Exploring the conformance space (extended abstract). In: ITBPM@BPM, ser. CEUR Workshop Proceedings, vol. 2952, pp. 62–67. CEUR-WS.org (2021)

    Google Scholar 

  3. Hildebrandt, T.T., Mukkamala, R.R.: Declarative event-based workflow as distributed dynamic condition response graphs. arXiv preprint arXiv:1110.4161 (2011)

  4. De Giacomo, G., De Masellis, R., Montali, M.: Reasoning on LTL on finite traces: insensitivity to infiniteness. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 28, no. 1 (2014)

    Google Scholar 

  5. Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G.: MiniZinc: towards a standard CP modelling language. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 529–543. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-74970-7_38

    Chapter  Google Scholar 

  6. Mahammed, N., Benslimane, S.M., Ouldkradda, A., Fahsi, M.: Evolutionary business process optimization using a multiple-criteria decision analysis method. In: International Conference on Computer, Information and Telecommunication Systems (CITS), Alsace, Colmar, France, pp. 1–5. IEEE (2018)

    Google Scholar 

  7. Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182–197 (2002)

    Article  Google Scholar 

  8. Vergidis, K., Saxena, D., Tiwari, A.: An evolutionary multi-objective framework for business process optimisation. Appl. Soft Comput. 12(8), 2638–2653 (2012)

    Article  Google Scholar 

  9. Georgoulakos, K., Vergidis, K., Tsakalidis, G., Samaras, N.: Evolutionary multi-objective optimization of business process designs with pre-processing. In: IEEE Congress on Evolutionary Computation (CEC), Spain, pp. 897–904. IEEE (2017)

    Google Scholar 

  10. Djedovic, A., Zunic, E., Avdagic, Z., Karabegovic, A.: Optimization of business processes by automatic reallocation of resources using the genetic algorithm. In: XI International Symposium on Telecommunications (BIHTEL), Sarajevo, Bosnia and Herzegovina, pp. 1–7. IEEE (2016)

    Google Scholar 

  11. Si, Y.-W., Chan, V.-I., Dumas, M., Zhang, D.: A petri nets based generic genetic algorithm framework for resource optimization in business processes. Simul. Model. Pract. Theory 86, 72–101 (2018)

    Article  Google Scholar 

  12. Jiménez-Ramírez, A., Weber, B., Barba, I., Del Valle, C.: Generating optimized configurable business process models in scenarios subject to uncertainty. Inf. Softw. Technol. 57, 571–594 (2015)

    Article  Google Scholar 

  13. Burattin, A., Guizzardi, G., Maggi, F.M., Montali, M.: Fifty shades of green: how informative is a compliant process trace? In: Giorgini, P., Weber, B. (eds.) CAiSE 2019. LNCS, vol. 11483, pp. 611–626. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-21290-2_38

    Chapter  Google Scholar 

  14. López-Pintado, O., Dumas, M., Yerokhin, M., Maggi, F.M.: Silhouetting the cost-time front: multi-objective resource optimization in business processes. In: Polyvyanyy, A., Wynn, M.T., Van Looy, A., Reichert, M. (eds.) BPM 2021. LNBIP, vol. 427, pp. 92–108. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-85440-9_6

    Chapter  Google Scholar 

  15. López, H.A., Debois, S., Slaats, T., Hildebrandt, T.T.: Business process compliance using reference models of law. In: International Conference on Fundamental Approaches to Software Engineering, pp. 378–399 (2020)

    Google Scholar 

  16. Jakob, W., Blume, C.: Pareto optimization or cascaded weighted sum: a comparison of concepts. Algorithms 7(1), 166–185 (2014)

    Article  Google Scholar 

  17. van Beek, P.: Backtracking search algorithms. In: Rossi, F., van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming. Foundations of Artificial Intelligence, vol. 2, pp. 85–134. Elsevier (2006). https://doi.org/10.1016/S1574-6526(06)80008-8

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Juan C. Rosero .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Diaz, J.F., López, H.A., Quesada, L., Rosero, J.C. (2024). Pareto-Optimal Trace Generation from Declarative Process Models. In: De Weerdt, J., Pufahl, L. (eds) Business Process Management Workshops. BPM 2023. Lecture Notes in Business Information Processing, vol 492. Springer, Cham. https://doi.org/10.1007/978-3-031-50974-2_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-50974-2_24

  • Published:

  • Publisher Name: Springer, Cham

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics