Advertisement

Time Management in Workflows with Loops

  • Margareta CiglicEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9416)

Abstract

The goal of this research is to enable proactive time management for workflows with loops. We want to offer time constraint patterns that allow the formulation of time constraints on activities that are contained in loops.

Furthermore we design an algorithm for timed workflow graph computation considering loops and given time constraints. We use the time constraints to bind unbounded loops such that we iteratively expand the workflow, compute the timed workflow graph and check the satisfiability of the time constraints.

We also deal with a fast recomputation of a timed workflow graph at the runtime, which is needed to care for slack distribution, situation assessment and enactment of escalation strategies.

Keywords

Time Constraint Time Management Iterative Graph Expansion Graph Expansion Situation Assessment 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Cimatti, A., Hunsberger, L., Micheli, A., Posenato, R., Roveri, M.: Sound and complete algorithms for checking the dynamic controllability of temporal networks with uncertainty, disjunction and observation. In: 21st International Symposium on Temporal Representation and Reasoning (TIME 2014), pp. 27–36. IEEE (2014)Google Scholar
  2. 2.
    Combi, C., Gambini, M., Migliorini, S., Posenato, R.: Representing business processes through a temporal data-centric workflow modeling language: An application to the management of clinical pathways. IEEE Transactions on Systems, Man, and Cybernetics: Systems 44(9), 1182–1203 (2014)CrossRefGoogle Scholar
  3. 3.
    Combi, C., Gozzi, M., Posenato, R., Pozzi, G.: Conceptual modeling of flexible temporal workflows. ACM Transactions on Autonomous and Adaptive Systems (TAAS) 7(2), 19 (2012)CrossRefGoogle Scholar
  4. 4.
    Eder, J., Panagos, E., Rabinovich, M.I.: Time constraints in workflow systems. In: Jarke, M., Oberweis, A. (eds.) CAiSE 1999. LNCS, vol. 1626, pp. 286–300. Springer, Heidelberg (1999) CrossRefGoogle Scholar
  5. 5.
    Eder, J., Panagos, E., Rabinovich, M.: Workflow time management revisited. In: Bubenko, J., et al. (eds.) Seminal Contributions to Information Systems Engineering, pp. 207–213. Springer, Heidelberg (2013)Google Scholar
  6. 6.
    Foyo, P.M.G.D., Silva, J.R.: Using time petri nets for modeling and verification of timed constrained workflow systems. ABCM Symposium Series in Mechatronics 3, 471–478 (2008)Google Scholar
  7. 7.
    Lanz, A., Posenato, R., Combi, C., Reichert, M.: Controllability of time-aware processes at run time. In: Meersman, R., Panetto, H., Dillon, T., Eder, J., Bellahsene, Z., Ritter, N., De Leenheer, P., Dou, D. (eds.) ODBASE 2013. LNCS, vol. 8185, pp. 39–56. Springer, Heidelberg (2013) CrossRefGoogle Scholar
  8. 8.
    Lanz, A., Weber, B., Reichert, M.: Time patterns for process-aware information systems. Requirements Engineering 19(2), 113–141 (2014)CrossRefGoogle Scholar
  9. 9.
    Lu, R., Sadiq, S.W., Padmanabhan, V., Governatori, G.: Using a temporal constraint network for business process execution. In: Dobbie, G., Bailey, J. (eds.) ADC 2006 Proceedings of the 17th Australasian Database Conference. CRPIT, vol. 49, pp. 157–166. Australian Computer Society (2006)Google Scholar
  10. 10.
    Marjanovic, O.: Dynamic verification of temporal constraints in production workflows. In: 11th Australasian Database Conference (ADC 2000), pp. 74–81. IEEE (2000)Google Scholar
  11. 11.
    Pichler, H.: Time management for workflow systems. A probabilistic approach for basic and advanced control flow structures. Ph.D. thesis, Alpen-Adria-Universitaet Klagenfurt (2006)Google Scholar
  12. 12.
    Son, J.H., Kim, J.S., Kim, M.H.: Extracting the workflow critical path from the extended well-formed workflow schema. Journal of Computer and System Sciences 70(1), 86–106 (2005)CrossRefMathSciNetzbMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Department of Informatics SystemsAlpen-Adria-Universität KlagenfurtKlagenfurtAustria

Personalised recommendations