An alternative way to analyze workflow graphs

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

Volumn 2348, Issue , 2002, Pages 535-552

  van der Aalst, W M P ^a   Hirnschall, A ^a   Verbeek, H M W ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS; INFORMATION SYSTEMS; PETRI NETS; SYSTEMS ENGINEERING;

ALTERNATIVE ALGORITHMS; DESIGN ERRORS; PETRI NET THEORIES; REDUCTION RULES; STRUCTURAL CONFLICT; WORKFLOW ANALYSIS; WORKFLOW GRAPH; WORKFLOW VERIFICATION;

ALGORITHMS;

EID: 84944029013     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (21)

1. 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.
2. 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.
3. 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: PetriNets, central models and their properties, volume 254 of Lecture Notes in Computer Science, pages 168-206. Springer-Verlag, Berlin, 1987.
4. F. Casati, F. S.Ceri B. Pernici, and G. Pozzi. Conceptual Modeling of Workflows. In M.P. Papazoglou, editor, Proceedings of the 14th International Object-Oriented and Entity-Relationship Modeling Conference, volume 1021 of Lecture Notes in Computer Science, pages 341-354. Springer-Verlag, Berlin, 1998.
5. 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.
6. J. Desel and J. Esparza. Free Choice Petri Nets, volume 40 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge, UK, 1995.
7. 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
8. M. H. T. Hack. Analysis production schemata by Petri nets. Master’s thesis, Massachusetts Institute of Technology, Cambridge, Mass., 1972.
9. A. H. M. ter Hofstede, M. E. Orlowska, and J. Rajapakse. Verification Problems in Conceptual Workflow Specifications. Data and Knowledge Engineering, 24(3):239-256, 1998.
10. P. Kemper. Linear Time Algorithm to Find a Minimal Deadlock in a Strongly Connected Free-Choice Net. In M. Ajmone Marsan, editor, Application and Theory of Petri Nets 1993, volume 691 of Lecture Notes in Computer Science, pages 319-338. Springer-Verlag, Berlin, 1993.
11. E. Kindler and W. M. P. van der Aalst. Liveness, Fairness, and Recurrence. Information Processing Letters, 70(6):269-274, June 1999.
12. D. Kuo, M. Lawley, C. Liu, and M. E. Orlowska. A General Model for Nested Transactional Workflows. In Proceedings of the International Workshop on Advanced Transaction Models and Architecture (ATMA’96), pages 18-35, Bombay, India, 1996.
13. P. Lawrence, editor. Workflow Handbook 1997, Workflow Management Coalition. John Wiley and Sons, New York, 1997.
14. H. Lin, Z. Zhao, H. Li, and Z. Chen. A Novel Graph Reduction Algorithm to Identify Structural Conflicts. In Proceedings of the Thirty-Fourth Annual Hawaii International Conference on System Science (HICSS-35). IEEE Computer Society Press, 2002.
15. T. Murata. Petri Nets: Properties, Analysis and Applications. Proceedings of the IEEE, 77(4):541-580, April 1989.
16. M. Reichert and P. Dadam. ADEPTflex: Supporting Dynamic Changes of Workflow without Loosing Control. Journal of Intelligent Information Systems, 10(2):93-129, 1998.
17. 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.
18. W. Sadiq and M. E. Orlowska. On Correctness Issues in Conceptual Modeling of Workflows. In Proceedings of the 5th European Conference on Information Systems (ECIS’97), pages 19-21, Cork, Ireland, 1997
19. W. Sadiq and M. E. Orlowska. Applying Graph Reduction Techniques for Identifying Structural Conflicts in Process Models. In M. Jarke and A. Oberweis, editors, Proceedings of the 11th International Conference on Advanced Information Systems Engineering (CAiSE’99), volume 1626 of Lecture Notes in Computer Science, pages 195-209. Springer-Verlag, Berlin, 1999.
20. W. Sadiq and M. E. Orlowska. Analyzing Process Models using Graph Reduction Techniques. Information Systems, 25(2):117-134, 2000.
21. H. M. W. Verbeek, T. Basten, and W.M.P. van der Aalst. Diagnosing Workflow Processes using Woflan. The Computer Journal, 44(4):246-279, 2001.