Nothing Special   »   [go: up one dir, main page]

Skip to main content

Dynamically Predicting the Deadlines in Time-Constrained Workflows

  • Conference paper
Web Information Systems Engineering – WISE 2013 Workshops (WISE 2013)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 8182))

Included in the following conference series:

Abstract

In order to predict workflow’s deadline, and improve the efficiency of the entire workflow management, this paper proposes an efficient method to dynamically predict the deadline of time-constrained workflows. This method improves the lack of the existing method in which all the paths in selection structures were assigned the same deadline. We apply LMST-invariant decomposition to decompose the selection structures of the workflow. With the checkpoints which are inserted on selection activities, we propose an efficient method to timely predict the workflow’s deadline. This method is more suitable for the practical application.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. van der Aalst, W.M.P.: The application of Petri nets to workflow management. Journal of Circuits Systems and Computers 8(l), 21–66 (1998)

    Article  Google Scholar 

  2. Li, H.F., Fan, Y.S.: Overview on Managing Time in Workflow Systems. Journal of software 13(8), 1552–1558 (2002)

    Google Scholar 

  3. Li, J.Q., Fan, Y.S., Zhou, M.C.: Performance modeling and analysis of workflow. IEEE Transactions on Systems, Man, and Cybernetics, Part A 34(2), 229–242 (2004)

    Article  Google Scholar 

  4. Li, J.Q., Fan, Y.S., Zhou, M.C.: Timing constraint workflow nets for workflow analysis. IEEE Transactions on Systems, Man, and Cybernetics, Part A 33(2), 179–193 (2003)

    Article  Google Scholar 

  5. Eder, J., Panagos, E., Pozewaunig, H., et al.: Time management in Workflow system. In: Proceedings of the 3rd International Conference on Business Information Systems (1999)

    Google Scholar 

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

    Chapter  Google Scholar 

  7. Marjanovic, O.: Dynamic verification of temporal constraints in production workflows. In: Proceedings of the 11th Australian Database Conference, pp. 74–81. IEEE (2000)

    Google Scholar 

  8. Son, J.H., Kim, J.H.: Finding the critical path in a time constrained workflow. In: Proceedings of the Seventh International Conference on Real-Time Systems and Applications, Cheju Island, South Korea, pp. 102–107. IEEE Compute Society (2000)

    Google Scholar 

  9. Son, J.H., Kim, J.H., Kim, M.H.: Deadline allocation in a time-constrained workflow. International Journal of Cooperative Information Systems 10(4), 509–530 (2001)

    Article  Google Scholar 

  10. Son, J.H., Kim, J.H., Kim, M.H.: An effective static deadline assignment method in workflow systems. In: Proceedings of the Fifth Joint Conference on Information Sciences, pp. 433–436. Duke University, Atlantic (2000)

    Google Scholar 

  11. Li, H.F., Feng, F.J.: Management and Dynamic Monitoring of Deadlines in Time-Constrained Workflows. Transactions of Beijing Institute of Technology 31(8), 938–943 (2011)

    Google Scholar 

  12. Ge, J.D., Hu, H., Lu, J.: A Transformation Approach from Workflow Net to PERT Diagram Based on Invariants. Acta Electronica Sinica 36(5), 893–898 (2008)

    Google Scholar 

  13. Chen, J., Yang, Y.: Adaptive selection of necessary and sufficient checkpoints for dynamic verification of temporal constraints in grid workflow systems. ACM Transactions on Autonomous and Adaptive Systems 2(2) (2007)

    Google Scholar 

  14. Chen, J., Yang, Y.: Temporal dependency-based checkpoint selection for dynamic verification of temporal constraints in scientific workflow systems. ACM Transactions on Software Engineering and Methodology 20(3) (2011)

    Google Scholar 

  15. Liu, X., Yuan, D., Zhang, G.F., et al.: The Design of Cloud Workflow Systems: Springer Briefs in Computer Science. Springer (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Guo, X. et al. (2014). Dynamically Predicting the Deadlines in Time-Constrained Workflows. In: Huang, Z., Liu, C., He, J., Huang, G. (eds) Web Information Systems Engineering – WISE 2013 Workshops. WISE 2013. Lecture Notes in Computer Science, vol 8182. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-54370-8_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-54370-8_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-54369-2

  • Online ISBN: 978-3-642-54370-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics