Skip to main content

Resource Planning in Workflow Nets Based on a Symbolic Time Constraint Propagation Mechanism

  • Conference paper
  • First Online:
Enterprise Information Systems (ICEIS 2022)

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

Included in the following conference series:

  • 167 Accesses

Abstract

The main proposal of this work is to present an approach based on the formalism of Petri nets in order to describe the time constraints of resources over the activities of Workflow Management Systems. Using Colored Petri nets, it is possible to separate the process model from the resource model and formally define the communication mechanisms between the two models. Each token from the Colored Petri net will then be able to carry the time information of each case, such as the start and end time of each activity the case will have to perform to complete the Workflow process. Such temporal data can be represented as a set of colors from the CPN model and will be used to monitor the execution of the process in order to find the right amount of resources involved in the execution of activities. The simulation of the CPN with time information then allows estimating the percentage of cases that respect the time constraints of the process (deadline delivery dates). In addition with the CPN simulation model proposed in this work for the improvement of resource planning in Workflow Management System, a time constraint propagation mechanism based on the sequent calculus of Linear Logic and on symbolic dates is proposed. Such propagation mechanism allows the instantaneous calculation of the time constraints that each new case must respect when entering the Workflow process.

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

References

  1. Van der Aalst, W.M.: The application of Petri nets to workflow management. J. Circuits Syst. Comput. 8(01), 21–66 (1998)

    Article  Google Scholar 

  2. Van der Aalst, W.M.P.: Timed coloured Petri nets and their application to logistics (1992)

    Google Scholar 

  3. Bruno, L.R., Julia, S.: A symbolic time constraint propagation mechanism proposal for workflow nets. In: ICEIS (1), pp. 537–544 (2022)

    Google Scholar 

  4. de Freitas, J.C.J., Julia, S.: Fuzzy time constraint propagation mechanism for workflow nets. In: 2015 12th International Conference on Information Technology-New Generations, pp. 367–372. IEEE (2015)

    Google Scholar 

  5. Girard, J.Y.: Linear logic. Theor. Comput. Sci. 50(1), 1–101 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  6. Girault, F., Pradier-Chezalviel, B., Valette, R.: A logic for Petri nets. Journal européen des systèmes automatisés 31(3), 525–542 (1997)

    Google Scholar 

  7. Jensen, K.: An introduction to the practical use of coloured Petri nets. In: Reisig, W., Rozenberg, G. (eds.) ACPN 1996. LNCS, vol. 1492, pp. 237–292. Springer, Heidelberg (1998). https://doi.org/10.1007/3-540-65307-4_50

    Chapter  Google Scholar 

  8. Jensen, K., Kristensen, L.M.: Coloured Petri Nets: Modelling and Validation of Concurrent Systems. Springer, Heidelberg (2009). https://doi.org/10.1007/b95112

    Book  MATH  Google Scholar 

  9. Jeske, J.C., Julia, S., Valette, R.: Fuzzy continuous resource allocation mechanisms in workflow management systems. In: 2009 XXIII Brazilian Symposium on Software Engineering, pp. 236–251. IEEE (2009)

    Google Scholar 

  10. Julia, S., de Oliveira, F.F., Valette, R.: Real time scheduling of workflow management systems based on a p-time Petri net model with hybrid resources. Simul. Model. Pract. Theory 16(4), 462–482 (2008)

    Article  Google Scholar 

  11. Khalfhoui, S., Demmou, H., Guilhem, E., Valette, R.: An algorithm for deriving critical scenarios in mechatronic systems. In: IEEE International Conference on Systems, Man and Cybernetics, vol. 3, pp. 6-pp. IEEE (2002)

    Google Scholar 

  12. Medeiros, F.F., Julia, S.: Constraint analysis based on energetic reasoning applied to the problem of real time scheduling of workflow management systems. In: ICEIS (3), pp. 373–380 (2017)

    Google Scholar 

  13. Menasche, M.: Analyse des réseaux de Petri temporisés et application aux systèmes distribués (1982)

    Google Scholar 

  14. Merlin, P.M.: A study of the recoverability of computing systems. University of California, Irvine (1974)

    Google Scholar 

  15. Milner, R., Tofte, M., Harper, R., MacQueen, D.: The Definition of Standard ML: Revised. MIT Press, Cambridge (1997)

    Book  Google Scholar 

  16. Oliveira, K.S., Julia, S.: Detection and removal of negative requirements of deadlock-type in service-oriented architectures. In: 2020 International Conference on Computational Science and Computational Intelligence (2020)

    Google Scholar 

  17. Passos, L.M.S., Julia, S.: Qualitative analysis of workflow nets using linear logic: soundness verification. In: 2009 IEEE International Conference on Systems, Man and Cybernetics, pp. 2843–2847. IEEE (2009)

    Google Scholar 

  18. Pradin-Chézalviel, B., Valette, R., Kunzle, L.A.: Scenario durations characterization of t-timed Petri nets using linear logic. In: Proceedings 8th International Workshop on Petri Nets and Performance Models (Cat. No. PR00331), pp. 208–217. IEEE (1999)

    Google Scholar 

  19. Ramamoorthy, C., Ho, G.S.: Performance evaluation of asynchronous concurrent systems using Petri nets. IEEE Trans. Softw. Eng. 5, 440–449 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  20. Riviere, N., Pradin-Chezalviel, B., Valette, R.: Reachability and temporal conflicts in t-time Petri nets. In: Proceedings 9th International Workshop on Petri Nets and Performance Models, pp. 229–238. IEEE (2001)

    Google Scholar 

  21. dos Santos Soares, M., Julia, S., Vrancken, J.: Real-time scheduling of batch systems using Petri nets and linear logic. J. Syst. Softw. 81(11), 1983–1996 (2008)

    Article  Google Scholar 

  22. Sifakis, J.: Use of Petri nets for performance evaluation. Acta Cybernet. 4(2), 185–202 (1979)

    MathSciNet  MATH  Google Scholar 

  23. Soares Passos, L.M., Julia, S.: Linear logic as a tool for qualitative and quantitative analysis of workow processes. Int. J. Artif. Intell. Tools 25(03), 1650008 (2016)

    Article  Google Scholar 

  24. Van Der Aalst, W., Van Hee, K.M., van Hee, K.: Workflow Management: Models, Methods, and Systems. MIT Press, Cambridge (2004)

    Google Scholar 

Download references

Acknowledgement

The authors would like to thank FAPEMIG, CNPq and CAPES for the financial support provided.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lorena Rodrigues Bruno .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 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

Bruno, L.R., Julia, S. (2023). Resource Planning in Workflow Nets Based on a Symbolic Time Constraint Propagation Mechanism. In: Filipe, J., Śmiałek, M., Brodsky, A., Hammoudi, S. (eds) Enterprise Information Systems. ICEIS 2022. Lecture Notes in Business Information Processing, vol 487. Springer, Cham. https://doi.org/10.1007/978-3-031-39386-0_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-39386-0_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-39385-3

  • Online ISBN: 978-3-031-39386-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics