Skip to main content

Soundness of Resource-Constrained Workflow Nets

  • Conference paper
Applications and Theory of Petri Nets 2005 (ICATPN 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3536))

Included in the following conference series:

Abstract

We study concurrent processes modelled as workflow Petri nets extended with resource constraints. We define a behavioural correctness criterion called soundness: given a sufficient initial number of resources, all cases in the net are guaranteed to terminate successfully, no matter which schedule is used. We give a necessary and sufficient condition for soundness and an algorithm that checks it.

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

References

  1. van der Aalst, W.M.P.: Verification of workflow nets. In: Azéma, P., Balbo, G. (eds.) ICATPN 1997. LNCS, vol. 1248. Springer, Heidelberg (1997)

    Google Scholar 

  2. van der Aalst, W.M.P.: The Application of Petri Nets to Workflow Management. The Journal of Circuits, Systems and Computers 8(1), 21–66 (1998)

    Article  Google Scholar 

  3. van der Aalst, W.M.P.: Workflow verification: Finding control-flow errors using Petri-net-based techniques. In: van der Aalst, W.M.P., Desel, J., Oberweis, A. (eds.) Business Process Management. LNCS, vol. 1806, pp. 161–183. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  4. van der Aalst, W.M.P., van Hee, K.M.: Workflow Management: Models, Methods, and Systems. MIT Press, Cambridge (2002)

    Google Scholar 

  5. Barkaoui, K., Petrucci, L.: Structural analysis of workflow nets with shared resources. In: Workflow management: Net-based Concepts, Models, Techniques and Tools (WFM 1998). Computing science reports, vol. 98/7, pp. 82–95. Eindhoven University of Technology (1998)

    Google Scholar 

  6. Colom, J.: The resource allocation problem in flexible manufacturing systems. In: van der Aalst, W.M.P., Best, E. (eds.) ICATPN 2003. LNCS, vol. 2679, pp. 23–35. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  7. Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1990)

    MATH  Google Scholar 

  8. Dijkstra, E.W.: Ewd 623. Selected writings on computing: a personal perspective (1982)

    Google Scholar 

  9. Ezpeleta, J.: Flexible manufacturing systems. In: Girault, C., Valk, R. (eds.) Petri nets for systems engineering. Springer, Heidelberg (2003)

    Google Scholar 

  10. Ezpeleta, J., Colom, J.M., Martínez, J.: A Petri net based deadlock prevention policy for flexible manufacturing systems. IEEE Transactions on Robotics and Automation 11(2), 173–184 (1995)

    Article  Google Scholar 

  11. van Hee, K., Sidorova, N., Voorhoeve, M.: Soundness and separability of workflow nets in the stepwise refinement approach. In: van der Aalst, W.M.P., Best, E. (eds.) ICATPN 2003. LNCS, vol. 2679, pp. 337–356. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  12. Lautenbach, K.: Liveness in Petri Nets. Internal Report of the Gesellschaft für Mathematik und Datenverarbeitung, Bonn, Germany, ISF/75-02-1 (1975)

    Google Scholar 

  13. Silva, M., Teruel, E.: Petri nets for the design and operation of manufacturing systems. European Journal of Control 3(3), 182–199 (1997)

    MATH  Google Scholar 

  14. Silva, M., Valette, R.: Petri nets and flexible manufacturing. In: Rozenberg, G. (ed.) APN 1989. LNCS, vol. 424, pp. 374–417. Springer, Heidelberg (1990)

    Google Scholar 

  15. Takaoka, T.: Subcubic cost algorithms for the all pairs shortest path problem. Algorithmica 3(20), 309–318 (1998)

    Article  MathSciNet  Google Scholar 

  16. Zwick, U.: Exact and approximate distances in graphs - A survey. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, pp. 33–48. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

van Hee, K., Serebrenik, A., Sidorova, N., Voorhoeve, M. (2005). Soundness of Resource-Constrained Workflow Nets. In: Ciardo, G., Darondeau, P. (eds) Applications and Theory of Petri Nets 2005. ICATPN 2005. Lecture Notes in Computer Science, vol 3536. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11494744_15

Download citation

  • DOI: https://doi.org/10.1007/11494744_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26301-2

  • Online ISBN: 978-3-540-31559-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics