Complexity of the Soundness Problem of Workflow Nets
From MaRDI portal
Publication:5415301
DOI10.3233/FI-2014-1005zbMath1286.90079MaRDI QIDQ5415301
Jun Sun, Jin-Song Dong, GuanJun Liu, Yang Liu
Publication date: 12 May 2014
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Theory of organizations, manpower planning in operations research (90B70)
Related Items
Sufficient and necessary condition to decide compatibility for a class of interorganizational workflow nets, PSPACE-Completeness of the Soundness Problem of Safe Asymmetric-Choice Workflow Nets