Free choice Petri nets
Complexity results for 1-safe nets
Theoretical Computer Science
Access control mechanisms for inter-organizational workflow
SACMAT '01 Proceedings of the sixth ACM symposium on Access control models and technologies
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Reset Nets Between Decidability and Undecidability
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Inter-operability of Workflow Applications: Local Criteria for Global Soundness
Business Process Management, Models, Techniques, and Empirical Studies
PETRI NET LANGUAGE
Verifying generalized soundness of workflow nets
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
Soundness of workflow nets: classification, decidability, and analysis
Formal Aspects of Computing
The ePNK: an extensible petri net tool for PNML
PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
Decidability Results for Soundness Criteria of Resource-Constrained Workflow Nets
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Complexity of the Soundness Problem of Workflow Nets
Fundamenta Informaticae - Application and Theory of Petri Nets and Concurrency, 2012
Hi-index | 0.00 |
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.