Skip to main content

A Workflow Instance Migration Algorithm for Improving Time Complexity

  • Conference paper
Advanced Research on Computer Science and Information Engineering (CSIE 2011)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 153))

Abstract

The current rapid economic development leads to extremely unstable of the enterprise business flow, so workflow model needs accommodate the dynamic change to better serve for enterprises. The problem of how to make the current workflow instance move to a new workflow model timely and accurately will be solved by the algorithm proposed in this paper. The article firstly illustrates the necessity of using the original workflow instance in new model, and analyzes the errors of the workflow instance migration process, then proposes a new workflow instance migration algorithm for improving time complexity based on Petri nets.

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

References

  1. Smith, T.F., Waterman, M.S.: Identification of Common Molecular Subsequences. J. Mol. Biol. 147, 195–197 (1981)

    Article  Google Scholar 

  2. ShenTu, X., Yao, M., Tang, X.: The research and application of flexible technology about workflow management system. Computer Technology and Development 20(1), 120–122 (2010)

    Google Scholar 

  3. Zhou, J., Shi, M., Ye, X.: The current situation and trend of flexible workflow technology research. Computer Integrated Manufacturing System 11(11), 1501–1510 (2005)

    Google Scholar 

  4. Aalst, W., Basten, T.: Inheritance of workflows:An approach to tackling problems related to change. Theoretical Computer Science 270(1-2), 125–203 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  5. Aalst, W.: Exterminating the dynamic change bug:A concrete approach to support workflow change. Eindhoven University of Technology, Eindhoven (2000)

    Google Scholar 

  6. Wang, J., Wen, L.: Workflow management-model, method and system. Tsinghua university press, Beijing (2004)

    Google Scholar 

  7. Lin, C.: Stochastic Petri nets and system performance evaluation. Tsinghua university press, Beijing (2005)

    Google Scholar 

  8. Aalst, W.: The Application of Petri Nets to Workflow Management. Journal of Circuits, Systems and Computers 8(1), 22–66 (1998)

    Google Scholar 

  9. Best, E., Desel, J., Esparza, J.: Traps characterize home states in free choice systems. Theoretical Computer Science 101, 161–171 (1992)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pan, H., Wu, J., Wu, C. (2011). A Workflow Instance Migration Algorithm for Improving Time Complexity. In: Shen, G., Huang, X. (eds) Advanced Research on Computer Science and Information Engineering. CSIE 2011. Communications in Computer and Information Science, vol 153. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21411-0_51

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21411-0_51

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21410-3

  • Online ISBN: 978-3-642-21411-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics