Complexity of the soundness problem of bounded workflow nets

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

Volumn 7347 LNCS, Issue , 2012, Pages 92-107

  Liu, Guan Jun ^a   Sun, Jun ^a   Liu, Yang ^b   Dong, Jin Song ^b  

^a SINGAPORE UNIVERSITY OF TECHNOLOGY AND DESIGN   (Singapore)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

co NP hardness; Petri nets; PSPACE hardness; soundness; workflow nets; workflow nets with reset arcs

Indexed keywords

CO-NP-HARDNESS; PSPACE-HARDNESS; RESET ARCS; SOUNDNESS; WORKFLOW NETS;

HARDNESS; POLYNOMIAL APPROXIMATION;

PETRI NETS;

EID: 84862494364     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-31131-4_6     Document Type: Conference Paper

References (19)

1. Van der Aalst, W.M.P.: Interorganizational Workflows: An Approach Based on Message Sequence Charts and Petri Nets. System Analysis and Modeling 34, 335-367 (1999)
2. Van der Aalst, W.M.P.: Loosely Coupled Interorganizational Wokflows: Modeling and Analyzing Workflows Crossing Organizational Boundaries. Inf. Manage. 37, 67-75 (2000)
3. Van der Aalst, W.M.P.: Structural Characterizations of Sound Workflow Nets. Computing Science Report 96/23, Eindhoven University of Technology (1996)
4. Van der Aalst, W.M.P., Van Hee, K.M., Ter Hofstede, A.H.M., Sidorova, N., Verbeek, H.M.W., Voorhoeve, M., Wynn, M.T.: Soundness of Workflow Nets: Classification, Decidability, and Analysis. Formal Aspects of Computing 23, 333-363 (2011)
5. Cheng, A., Esparza, J., Palsberg, J.: Complexity Results for 1-safe Nets. Theoretical Computer Science 147, 117-136 (1995)
6. Desel, J., Esparza, J.: Free Choice Petri Nets. Cambridge Tracts in Theoretical Computer Science, vol. 40. Cambridge University Press, Cambridge (1995)
7. Dufourd, C., Finkel, A., Schnoebelen, P.: Reset Nets Between Decidability and Undecidability. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 103-115. Springer, Heidelberg (1998)
8. Dufourd, C., Jančar, P., Schnoebelen, P.: Boundedness of Reset P/T Nets. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 301-310. Springer, Heidelberg (1999)
9. Garey, M.R., Johnson, D.S.: Computer and Intractability: A Guide to the Theory of NP Completeness. W. H. Freeman and Company (1976)
10. Hack, M.: Petri Net Languages. Technical Report 159. MIT (1976)
11. van Hee, K.M., Sidorova, N., Voorhoeve, M.: Generalised Soundness of Workflow Nets Is Decidable. In: Cortadella, J., Reisig,W. (eds.) ICATPN 2004. LNCS, vol. 3099, pp. 197-215. Springer, Heidelberg (2004)
12. Kang, M.H., Park, J.S., Froscher, J.N.: Access Control Mechanisms for Inter-organizational Workflow. In: Proc. of the Sixth ACM Symposium on Access Control Models and Technologies, pp. 66-74. ACM Press, New York (2001)
13. Kindler, E.: The ePNK: An Extensible Petri Net Tool for PNML. In: Kristensen, L.M., Petrucci, L. (eds.) PETRI NETS 2011. LNCS, vol. 6709, pp. 318-327. Springer, Heidelberg (2011)
14. Kindler, E., Martens, A., Reisig, W.: Inter-operability of Workflow Applications: Local Criteria for Global Soundness. In: van der Aalst, W.M.P., Desel, J., Oberweis, A. (eds.) BPM 2000. LNCS, vol. 1806, pp. 235-253. Springer, Heidelberg (2000)
15. Ohta, A., Tsuji, K.: NP-hardness of Liveness Problem of Bounded Asymmetric Choice Net. IEICE Trans. Fundamentals E85-A, 1071-1074 (2002)
16. Tiplea, F.L., Bocaneala, C.: Decidability Results for Soundness Criteria of Resource- ConstrainedWorkflow Nets. IEEE Trans. on Systems, man, and Cybernetics, PartA: Systems and Humans 42, 238-249 (2011)
17. Verbeek, H.M.W., Van der Aalst, W.M.P., Ter Hofstede, A.H.M.: Verifying Worklows with Cancellation Regions and OR-joins: An Approach Based on Relaxed Soundness and Invariants. Computer Journal 50, 294-314 (2007)
18. Verbeek, H.M.W., Wynn, M.T., Van der Aalst, W.M.P., Ter Hofstede, A.H.M.: Reduction Rules for Reset/Inhibitor Nets. BMP Center Report BMP-07-13, BMP-center.org (2007)
19. Van der Vlugt, S., Kleijn, J., Koutny, M.: Coverability and Inhibitor Arcs: An Example. Technical Report 1293, University of Newcastle Upon Tyne (2011)