Skip to main content
SpringerLink
Log in

A Logical Formalization of Time-Critical Processes with Resources

  • Conference paper
  • First Online:
Business Process Management Forum (BPM 2018)

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

Included in the following conference series:

Abstract

Checking time-critical properties of concurrent process instances having a finite amount of allocated resources is a challenging task. Modelling and understanding at design time the interactions of concurrent activities along the time line can become quite cumbersome, even for expert designers. In this paper, we consider processes that are composed of activities having a constrained duration and a bounded number of allocated resources, and we rely on a well-studied first order formalism, called , to model and verify the interdependencies among multiple and concurrent process instances. Then, we show the expressiveness of our approach by describing the temporal properties that may be expressed through it. Throughout all the paper, we refer to a real clinical scenario to motivate our approach and showcase its expressiveness.

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 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.

    A Pareto optimal solution is a solution that is not dominated by any other solution, in this case we are looking for pairs \((k',n')\) with \(k' < k\) and \(n' <n\) such that Property 2 does not hold on \((D,\mathcal {R},k'+1,k,n',n)\) and \((D,\mathcal {R},k',k,n'+1,n)\).

References

  1. Aiswarya, C., Bollig, B., Gastin, P.: An automata-theoretic approach to the verification of distributed algorithms. In: CONCUR 2015, vol. 42, pp. 340–353. Leibniz-Zentrum für Informatik (2015)

    Google Scholar 

  2. Attie, P.C., Singh, M.P., Emerson, E.A., Sheth, A., Rusinkiewicz, M.: Scheduling workflows by enforcing intertask dependencies. Distrib. Syst. Engi. 3(4), 222–238 (1996)

    Article  Google Scholar 

  3. Bengtsson, J., Larsen, K., Larsson, F., Pettersson, P., Yi, W.: UPPAAL — a tool suite for automatic verification of real-time systems. In: Alur, R., Henzinger, T.A., Sontag, E.D. (eds.) HS 1995. LNCS, vol. 1066, pp. 232–243. Springer, Heidelberg (1996). https://doi.org/10.1007/BFb0020949

    Chapter  Google Scholar 

  4. Bojańczyk, M., David, C., Muscholl, A., Schwentick, T., Segoufin, L.: Two-variable logic on data words. ACM Trans. Comput. Log. 12(4), 27:1–27:26 (2011)

    Article  Google Scholar 

  5. Bresolin, D., Montanari, A., Sala, P., Sciavicco, G.: Optimal decision procedures for MPNL over finite structures, the natural numbers, and the integers. Theor. Comput. Sci. 493, 98–115 (2013). https://doi.org/10.1016/j.tcs.2012.10.043

    Article  Google Scholar 

  6. Cabanillas, C., Knuplesch, D., Resinas, M., Reichert, M., Mendling, J., Ruiz-Cortés, A.: RALph: a graphical notation for resource assignments in business processes. In: Zdravkovic, J., Kirikova, M., Johannesson, P. (eds.) CAiSE 2015. LNCS, vol. 9097, pp. 53–68. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-19069-3_4

    Chapter  Google Scholar 

  7. Calvanese, D., De Giacomo, G., Montali, M., Patrizi, F.: First-order \(\mu \)-calculus over generic transition systems and applications to the situation calculus. Inf. Comput. 259(3), 328–347 (2018). https://doi.org/10.1016/j.ic.2017.08.007

    Article  Google Scholar 

  8. Du, Y., Xiong, P., Fan, Y., Li, X.: Dynamic checking and solution to temporal violations in concurrent workflow processes. IEEE Trans. Syst. Man Cybern. Part A Syst. Hum. 41(6), 1166–1181 (2011)

    Article  Google Scholar 

  9. Dumas, M., García-Bañuelos, L., Polyvyanyy, A.: Unraveling unstructured process models. In: Mendling, J., Weidlich, M., Weske, M. (eds.) BPMN 2010. LNBIP, vol. 67, pp. 1–7. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-16298-5_1

    Chapter  Google Scholar 

  10. Dumas, M., La Rosa, M., Mendling, J., Reijers, H.A.: Fundamentals of Business Process Management, vol. 1. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-662-56509-4

    Book  Google Scholar 

  11. Eder, J., Panagos, E., Rabinovich, M.: Workflow time management revisited. In: Bubenko, J., Krogstie, J., Pastor, O., Pernici, B., Rolland, C., Sølvberg, A. (eds.) Seminal Contributions to Information Systems Engineering, pp. 207–213. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-36926-1_16

    Chapter  Google Scholar 

  12. Figueira, D.: A decidable two-way logic on data words. In: ACM/IEEE Symposium in Logics in Computer Science (LICS), pp. 365–374 (2011)

    Google Scholar 

  13. Hariri, B.B., Calvanese, D., De Giacomo, G., Deutsch, A., Montali, M.: Verification of relational data-centric dynamic systems with external services. PODS 2013, 163–174 (2013)

    Google Scholar 

  14. Havur, G., Cabanillas, C., Mendling, J., Polleres, A.: Resource allocation with dependencies in business process management systems. In: La Rosa, M., Loos, P., Pastor, O. (eds.) BPM 2016. LNBIP, vol. 260, pp. 3–19. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-45468-9_1

    Chapter  Google Scholar 

  15. Kieronski, E., Tendera, L.: On finite satisfiability of two-variable first-order logic with equivalence relations. LICS 2009, 123–132 (2009)

    Google Scholar 

  16. Li, H., Yang, Y.: Dynamic checking of temporal constraints for concurrent workflows. Electron. Commer. Res. Appl. 4(2), 124–142 (2005)

    Article  Google Scholar 

  17. Ly, L.T., Maggi, F.M., Montali, M., Rinderle-Ma, S., van der Aalst, W.M.P.: Compliance monitoring in business processes: functionalities, application, and tool-support. Inf. Syst. 54, 209–234 (2015). https://doi.org/10.1016/j.is.2015.02.007

    Article  Google Scholar 

  18. Manna, Z., Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems. Springer, New York (1992). https://doi.org/10.1007/978-1-4612-0931-7

    Book  Google Scholar 

  19. Montanari, A., Pazzaglia, M., Sala, P.: Metric propositional neighborhood logic with an equivalence relation. Acta Inf. 53(6–8), 621–648 (2016)

    Article  Google Scholar 

  20. Montanari, A., Sala, P.: Interval-based synthesis. GandALF 2014, 102–115 (2014)

    Google Scholar 

  21. Morales, L.E.M., Monsalve, C., Villavicencio, M.: Formal verification of business processes as timed automata. CISTI 2017, 1–6 (2017)

    Google Scholar 

  22. Object Management Group: Business Process Model and Notation (BPMN), v2.0.2. www.omg.org/spec/BPMN/2.0.2/

  23. Russell, N., van der Aalst, W.M.P., ter Hofstede, A.H.M., Edmond, D.: Workflow resource patterns: identification, representation and tool support. In: Pastor, O., Falcão e Cunha, J. (eds.) CAiSE 2005. LNCS, vol. 3520, pp. 216–232. Springer, Heidelberg (2005). https://doi.org/10.1007/11431855_16

    Chapter  Google Scholar 

  24. Senkul, P., Toroslu, I.H.: An architecture for workflow scheduling under resource allocation constraints. Inf. Syst. 30(5), 399–422 (2005)

    Article  Google Scholar 

  25. Zhou, M., Fanti, M.P.: Deadlock Resolution in Computer-Integrated Systems. CRC Press, Boca Raton (2004)

    Google Scholar 

Download references

Acknowledgments

The authors would like to thank the anonymous reviewers for their constructive criticism and the series of invaluable suggestions that will fuel the future developments of the present work.

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Verona, Verona, Italy

    Carlo Combi, Pietro Sala & Francesca Zerbato

Authors
  1. Carlo Combi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pietro Sala
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Francesca Zerbato
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Carlo Combi .

Editor information

Editors and Affiliations

  1. Hasso-Plattner Institute, University of Potsdam, Potsdam, Germany

    Mathias Weske

  2. Free University of Bozen-Bolzano, Bolzano, Italy

    Marco Montali

  3. Data61, CSIRO, Eveleigh, New South Wales, Australia

    Ingo Weber

  4. University of Liechtenstein, Vaduz, Liechtenstein

    Jan vom Brocke

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Combi, C., Sala, P., Zerbato, F. (2018). A Logical Formalization of Time-Critical Processes with Resources. In: Weske, M., Montali, M., Weber, I., vom Brocke, J. (eds) Business Process Management Forum. BPM 2018. Lecture Notes in Business Information Processing, vol 329. Springer, Cham. https://doi.org/10.1007/978-3-319-98651-7_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-98651-7_2

  • Published:

  • Publisher Name: Springer, Cham

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation