Advertisement

Workflow Verification: Finding Control-Flow Errors Using Petri-Net-Based Techniques

  • W. M. P. van der Aalst
Chapter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1806)

Abstract

Workflow management systems facilitate the everyday operation of business processes by taking care of the logistic control of work. In contrast to traditional information systems, they attempt to support frequent changes of the workflows at hand. Therefore, the need for analysis methods to verify the correctness of workflows is becoming more prominent. In this chapter we present a method based on Petri nets. This analysis method exploits the structure of the Petri net to find potential errors in the design of the workflow. Moreover, the analysis method allows for the compositional verification of workflows.

Keywords

Business Process Reachable State Modular Analysis Hierarchy Concept Input Place 
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.
    W.M.P. van der Aalst. Three Good Reasons for Using a Petri-net-based Workflow Management System. In S. Navathe and T. Wakayama, editors, Proceedings of the International Working Conference on Information and Process Integration in Enterprises (IPI’96), pages 179–201, Camebridge, Massachusetts, Nov 1996.Google Scholar
  2. 2.
    W.M.P. van der Aalst. Verification of Workflow Nets. In P. Azéma and G. Balbo, editors, Application and Theory of Petri Nets 1997, volume 1248 of Lecture Notes in Computer Science, pages 407–426. Springer-Verlag, Berlin, 1997.CrossRefGoogle Scholar
  3. 3.
    W.M.P. van der Aalst. The Application of Petri Nets to Workflow Management. The Journal of Circuits, Systems and Computers, 8(1):21–66, 1998.CrossRefGoogle Scholar
  4. 4.
    W.M.P. van der Aalst. Woflan: A Petri-net-based Workflow Analyzer. Systems Analysis-Modelling-Simulation, 35(3):345–357, 1999.zbMATHGoogle Scholar
  5. 5.
    W.M.P. van der Aalst, D. Hauschildt, and H.M.W. Verbeek. A Petri-net-based Tool to Analyze Workflows. In B. Farwer, D. Moldt, and M.O. Stehr, editors, Proceedings of Petri Nets in System Engineering (PNSE’97), pages 78–90, Hamburg, Germany, September 1997. University of Hamburg (FBI-HH-B-205/97).Google Scholar
  6. 6.
    K. Barkaoui, J.M. Couvreur, and C. Dutheillet. On liveness in Extended Non Self-Controlling Nets. In G. De Michelis and M. Diaz, editors, Application and Theory of Petri Nets 1995, volume 935 of Lecture Notes in Computer Science, pages 25–44. Springer-Verlag, Berlin, 1995.CrossRefGoogle Scholar
  7. 7.
    E. Best. Structure Theory of Petri Nets: the Free Choice Hiatus. In W. Brauer, W. Reisig, and G. Rozenberg, editors, Advances in Petri Nets 1986 Part I: Petri Nets, central models and their properties, volume 254 of Lecture Notes in Computer Science, pages 168–206. Springer-Verlag, Berlin, 1987.Google Scholar
  8. 8.
    A. Cheng, J. Esparza, and J. Palsberg. Complexity results for 1-safe nets. In R.K. Shyamasundar, editor, Foundations of software technology and theoretical computer science, volume 761 of Lecture Notes in Computer Science, pages 326–337. Springer-Verlag, Berlin, 1993.CrossRefGoogle Scholar
  9. 9.
    J. Desel. A proof of the Rank theorem for extended free-choice nets. In K. Jensen, editor, Application and Theory of Petri Nets 1992, volume 616 of Lecture Notes in Computer Science, pages 134–153. Springer-Verlag, Berlin, 1992.CrossRefGoogle Scholar
  10. 10.
    J. Desel and J. Esparza. Free Choice Petri Nets, volume 40 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge, UK, 1995.CrossRefzbMATHGoogle Scholar
  11. 11.
    C.A. Ellis and G.J. Nutt. Modelling and Enactment of Workflow Systems. In M. Ajmone Marsan, editor, Application and Theory of Petri Nets 1993, volume 691 of Lecture Notes in Computer Science, pages 1–16. Springer-Verlag, Berlin, 1993.CrossRefGoogle Scholar
  12. 12.
    J. Esparza. Synthesis rules for Petri nets, and how they can lead to new results. In J.C.M. Baeten and J.W. Klop, editors, Proceedings of CONCUR 1990, volume 458 of Lecture Notes in Computer Science, pages 182–198. Springer-Verlag, Berlin, 1990.Google Scholar
  13. 13.
    J. Esparza and M. Silva. Circuits, Handles, Bridges and Nets. In G. Rozenberg, editor, Advances in Petri Nets 1990, volume 483 of Lecture Notes in Computer Science, pages 210–242. Springer-Verlag, Berlin, 1990.CrossRefGoogle Scholar
  14. 14.
    K. Gostellow, V. Cerf, G. Estrin, and S. Volansky. Proper Termination of Flow-of-control in Programs Involving Concurrent Processes. ACM Sigplan, 7(11):15–27, 1972.CrossRefGoogle Scholar
  15. 15.
    M.H.T. Hack. Analysis production schemata by Petri nets. Master’s thesis, Massachusetts Institute of Technology, Cambridge, Mass., 1972.Google Scholar
  16. 16.
    S. Jablonski and C. Bussler. Workflow Management: Modeling Concepts, Architecture, and Implementation. International Thomson Computer Press, London, UK, 1996.Google Scholar
  17. 17.
    E. Kindler and W.M.P. van der Aalst. Liveness, Fairness, and Recurrence. Information Processing Letters, 1999 (to appear).Google Scholar
  18. 18.
    G. De Michelis, C. Ellis, and G. Memmi, editors. Proceedings of the second Workshop on Computer-Supported Cooperative Work, Petri nets and related formalisms, Zaragoza, Spain, June 1994.Google Scholar
  19. 19.
    W. Reisig. Petri Nets: An Introduction, volume 4 of EATCS Monographs in Theoretical Computer Science. Springer-Verlag, Berlin, 1985.CrossRefzbMATHGoogle Scholar
  20. 20.
    W. Reisig and G. Rozenberg, editors. Lectures on Petri Nets I: Basic Models, volume 1491 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1998.zbMATHGoogle Scholar
  21. 21.
    Software-Ley. COSA User Manual. Software-Ley GmbH, Pullheim, Germany, 1998.Google Scholar
  22. 22.
    R. Valette. Analysis of Petri Nets by Stepwise Refinements. Journal of Computer and System Sciences, 18:35–46, 1979.MathSciNetCrossRefzbMATHGoogle Scholar
  23. 23.
    E. Verbeek and W.M.P. van der Aalst. Woflan Home Page. http://www.win.tue.nl/~woflan.
  24. 24.
    H.M.W. Verbeek, T. Basten, and W.M.P. van der Aalst. Diagnosing Workflow Processes using Woflan. Computing Science Report 99/02, Eindhoven University of Technology, Eindhoven, 1999.zbMATHGoogle Scholar
  25. 25.
    WFMC. Workflow Management Coalition Terminology and Glossary (WFMC-TC-1011). Technical report, Workflow Management Coalition, Brussels, 1996.Google Scholar
  26. 26.
    M. Wolf and U. Reimer, editors. Proceedings of the International Conference on Practical Aspects of Knowledge Management (PAKM’96), Workshop on Adaptive Workflow, Basel, Switzerland, Oct 1996.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • W. M. P. van der Aalst
    • 1
  1. 1.Faculty of Technology and Management, Department of Information and TechnologyEindhoven University of TechnologyEindhovenThe Netherlands

Personalised recommendations