Soundness-preserving reduction rules for reset workflow nets

Information Sciences

Volumn 179, Issue 6, 2009, Pages 769-790

  Wynn, M T ^a   Verbeek, H M W ^b   van der Aalst, W M P ^a,b   ter Hofstede, A H M ^a   Edmond, D ^a  

^a QUEENSLAND UNIVERSITY OF TECHNOLOGY   (Australia)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Reduction rules; Reset nets; Soundness; Workflow verification

Indexed keywords

GRAPH THEORY; MANAGEMENT; PETRI NETS; WORK SIMPLIFICATION;

BUSINESS PROCESS MODELLING; ONE WAYS; PETRI NET; PROCESS MODELS; REDUCTION RULES; RESET ARCS; RESET NETS; SOUNDNESS; STATE SPACES; TIME CONSUMING; WORK-FLOW SYSTEMS; WORKFLOW DOMAINS; WORKFLOW MANAGEMENTS; WORKFLOW NETS; WORKFLOW VERIFICATION; WORKFLOWS;

MARINE BIOLOGY;

EID: 58049105071     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2008.10.033     Document Type: Article

References (16)

1. van der Aalst W.M.P. Verification of workflow nets. In: Azéma P., and Balbo G. (Eds). Proceedings of Application and Theory of Petri Nets, Toulouse, France, 1997. Lecture Notes in Computer Science vol. 1248 (1997), Springer-Verlag 407-426
2. van der Aalst W.M.P., and van Hee K.M. Workflow Management: Models, Methods and Systems (2004), MIT Press, Cambridge, MA
3. van der Aalst W.M.P., ter Hofstede A.H.M., Kiepuszewski B., and Barros A.P. Workflow patterns. Distributed and Parallel Databases 14 (2003) 5-51
4. Berthelot G. Transformations and decompositions of nets. In: Brauer W., Reisig W., and Rozenberg G. (Eds). Petri Nets: Central Models and Their Properties, Advances in Petri Nets, Part 1, Proceedings of an Advanced Course, Bad Honnef, September 1986. Lecture Notes in Computer Science vol. 254 (1986), Springer-Verlag 359-376
5. Darondeau P. Unbounded Petri net synthesis. In: Desel J., Reisig W., and Rozenberg G. (Eds). Lectures on Concurrency and Petri Nets, Advances in Petri Nets, Eichstätt, Germany, 2003. Lecture Notes in Computer Science vol. 3098 (2003), Springer-Verlag 413-428
6. Desel J., and Esparza J. Free Choice Petri Nets. Cambridge Tracts in Theoretical Computer Science vol. 60 (1995), Cambridge University Press, Cambridge, United Kingdom
7. van Dongen B.F., van der Aalst W.M.P., and Verbeek H.M.W. Verification of EPCs: using reduction rules and Petri nets. In: Pastor O., and Falcão e Cunha J. (Eds). Proceedings of the 17th Conference on Advanced Information Systems Engineering (CAiSE 2005), Porto, Portugal, June 2005. Lecture Notes in Computer Science vol. 3520 (2005), Springer-Verlag 372-386
8. Dufourd C., Finkel A., and Schnoebelen Ph. Reset nets between decidability and undecidability. In: Larsen K., Skyum S., and Winskel G. (Eds). Proceedings of the 25th International Colloquium on Automata, Languages and Programming, Aalborg, Denmark, July 1998. Lecture Notes in Computer Science vol. 1443 (1998), Springer-Verlag 103-115
9. Dufourd C., Jančar P., and Schnoebelen Ph. Boundedness of reset P/T nets. In: Wiedermann J., van Emde Boas P., and Nielsen M. (Eds). Lectures on Concurrency and Petri Nets, Prague, Czech Republic, July 1999. Lecture Notes in Computer Science vol. 1644 (1999), Springer-Verlag 301-310
10. Finkel A., Raskin J.-F., Samuelides M., and van Begin L. Monotonic extensions of Petri nets: forward and backward search revisited. Electronic Notes in Theoretical Computer Science 68 6 (2002) 1-22
11. Finkel A., and Schnoebelen Ph. Well-structured transition systems everywhere!. Theoretical Computer Science 256 1-2 (2001) 63-92
12. van Hee K., Sidorova N., and Voorhoeve M. Generalised soundness of workflow nets is decidable. In: Cortadella J., and Reisig W. (Eds). Proceedings of Application and Theory of Petri Nets 2004. Lecture Notes in Computer Science vol. 3099 (2004), Springer-Verlag 197-215
13. Murata T. Petri nets: properties analysis and applications. Proceedings of the IEEE 77 4 (1989) 541-580
14. Sloan R.H., and Buy U.A. Reduction rules for time Petri nets. Acta Informatica 33 7 (1996) 687-706
15. H.M.W. Verbeek, Verification of WF-nets, Ph.D. Thesis, Eindhoven University of Technology, Eindhoven, The Netherlands, June 2004.
16. M.T. Wynn, Semantics, Verification, and Implementation of Workflows with Cancellation Regions and OR-joins, Ph.D. Thesis, Faculty of Information Technology, Queensland University of Technology, November 2006.