Verification of workflow nets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1248, Issue , 1997, Pages 407-426

  van der Aalst, W M P ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

PETRI NETS; WORK SIMPLIFICATION;

BUSINESS PROCEDURES; EXPLICIT REPRESENTATION; FUTURE INFORMATION SYSTEMS; TRANSFORMATION RULES; VALIDATION AND VERIFICATION; WORKFLOW MANAGEMENT SYSTEMS; WORKFLOW NETS;

INFORMATION MANAGEMENT;

EID: 52449135365     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63139-9_48     Document Type: Conference Paper

References (26)

1. W.M.P. van der Aalst. Putting Petri nets to work in industry. Computers in Industry, 25(1):45-54, 1994.
2. W.M.P. van der Aalst. A class of Petti net for modeling and analyzing business processes. Computing Science Reports 95/26, Eindhoven University of Technology, Eindhoven, 1995.
3. W.M.P. van der Aalst. Petri-net-based Workflow Management Software. In A. Sheth, editor, Proceedings of the NFS Workshop on Workflow and Process Automation in Information Systems, pages 114-118, Athens, Georgia, May 1996.
4. 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 (IPIC’96), pages 179-201, Camebridge, Massachusetts, Nov 1996.
5. W.M.P. van der Aalst and K.M. van Hee. Business Process Redesign: A Petri-net-based approach. Computers in Industry, 29(1-2): 15-26, 1996.
6. W.M.P. van der Aalst and K.M. van Hee. Workflow Management: Modellen, Methoden en Systemen (in Dutch). Academic Service, Schoonhoven, 1997.
7. G. Berthelot. Transformations and decompositions of nets. 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 360-376. Springer-Verlag, Berlin, 1987.
8. 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-Vedag, Berlin, 1987.
9. A. Cheng, X Esparza, and J. Palsberg. Complexity results for 1-safe nets. In R.K. Shyama-sundar, editor, Foundations of software technology and theoretical computer science, volume 761 of Lecture Notes in Computer Science, pages 326-337. Springer-Verlag, Berlin, 1993.
10. J. Desel. Reduction and design of well-behaved concurrent systems. In XC.M. Baeten and J.W. Klop, editors, Proceedings of CONCUR 1990, volume 458 of Lecture Notes in Computer Science, pages 166-181. Springer-Verlag, Berlin, 1990.
11. 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.
12. J. Desel and J. Esparza. Free choice Petri nets, volume 40 of Cambridge tracts in theoretical computer science. Cambridge University Press, Cambridge, 1995.
13. 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.
14. 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.
15. 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.
16. V. Gruhn. Validation and Verification of Software Process Models. In A. Endres and H. Weber, editors, Software Development Environments and CASE Technology, volume 509 of Lecture Notes in Computer Science, pages 271-286. Springer-Verlag, Berlin, 1991.
17. M.H.T. Hack. Analysis production schemata by Petri nets. Master’s thesis, Massachusetts Institute of Technology, Cambridge, Mass., 1972.
18. T.M. Koulopoulos. The Workflow Imperative. Van Nostrand Reinhold, New York, 1995.
19. A.V. Kovalyov. On complete reducability of some classes of Petri nets. In Proceedings of the 11th International Conference on Applications and Theory of Petri Nets, pages 352-366, Paris, June 1990.
20. T. Murata. Petri Nets: Properties, Analysis and Applications. Proceedings of the IEEE, 77(4):541-580, April 1989.
21. J.L. Peterson. Petri net theory and the modeling of systems. Prentice-Hall, Englewood Cliffs, 1981.
22. C.A. Petri. Kommunikation mit Automaten. PhD thesis, Institut für instrumenteile Mathematik, Bonn, 1962.
23. T. Schäl. Workflow Management for Process Organisations, volume 1096 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1996.
24. P.A. Straub and C. Hurtado. The Simple Control Property of Business Process Models. In XV International Conference of the Chilean Computer Science Society, 1995.
25. R. Valette. Analysis of Petri Nets by Stepwise Refinements. Journal of Computer and System Sciences, 18:35-46, 1979.
26. WFMC. Workflow Management Coalition Terminology and Glossary (WFMC-TC-1011). Technical report, Workflow Management Coalition, Brussels, 1996.