Publication Type
Conference Proceeding Article
Version
publishedVersion
Publication Date
6-2012
Abstract
Classical workflow nets (WF-nets) are an important class of Petri nets that are widely used to model and analyze workflow systems. Soundness is a crucial property that guarantees these systems are deadlock-free and bounded. Aalst et al. proved that the soundness problem is decidable, and proposed (but not proved) that the soundness problem is EXPSPACE-hard. In this paper, we show that the satisfiability problem of Boolean expression is polynomial time reducible to the liveness problem of bounded WF-nets, and soundness and liveness are equivalent for bounded WF-nets. As a result, the soundness problem of bounded WF-nets is co-NP-hard.Workflow nets with reset arcs (reWF-nets) are an extension to WF-nets, which enhance the expressiveness of WF-nets. Aalst et al. proved that the soundness problem of reWF-nets is undecidable. In this paper, we show that for bounded reWF-nets, the soundness problem is decidable and equivalent to the liveness problem. Furthermore, a bounded reWF-net can be constructed in polynomial time for every linear bounded automaton (LBA) with an input string, and we prove that the LBA accepts the input string if and only if the constructed reWF-net is live. As a result, the soundness problem of bounded reWF-nets is PSPACE-hard.
Keywords
Petri nets, workflow nets, workflow nets with reset arcs, soundness, co-NP-hardness, PSPACE-hardness
Discipline
Programming Languages and Compilers | Software Engineering
Research Areas
Software and Cyber-Physical Systems
Publication
Proceedings of the 33rd International Conference, PETRI NETS 2012, Hamburg, Germany, June 25-29
First Page
92
Last Page
107
ISBN
9783642311307
Identifier
10.1007/978-3-642-31131-4_6
Publisher
Springer Link
City or Country
Hamburg, Germany
Citation
LIU, Guan Jun; SUN, Jun; LIU, Yang; and DONG, Jin Song.
Complexity of the soundness problem of bounded workflow nets. (2012). Proceedings of the 33rd International Conference, PETRI NETS 2012, Hamburg, Germany, June 25-29. 92-107.
Available at: https://ink.library.smu.edu.sg/sis_research/5013
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Additional URL
https://doi.org/10.1007/978-3-642-31131-4_6