Back to Search
Start Over
On the Complexity of Deciding Soundness of Acyclic Workflow Nets.
- Source :
-
IEEE Transactions on Systems, Man & Cybernetics. Systems . Sep2015, Vol. 45 Issue 9, p1292-1298. 7p. - Publication Year :
- 2015
-
Abstract
- This paper focuses on the complexity of the (weak) soundness problem of acyclic workflow (WF) nets, and two main results are established: 1) soundness of 1-bounded acyclic WF nets is co-NP-complete and 2) weak soundness of 3-bounded acyclic asymmetric-choice WF nets is co-NP-complete. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 21682216
- Volume :
- 45
- Issue :
- 9
- Database :
- Academic Search Index
- Journal :
- IEEE Transactions on Systems, Man & Cybernetics. Systems
- Publication Type :
- Academic Journal
- Accession number :
- 108971067
- Full Text :
- https://doi.org/10.1109/TSMC.2015.2394735