Complexity of the soundness problem of workflow nets
From MaRDI portal
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Theory of organizations, manpower planning in operations research (90B70)
Recommendations
- Complexity of the soundness problem of bounded workflow nets
- PSPACE-completeness of the soundness problem of safe asymmetric-choice workflow nets
- Soundness of workflow nets: classification, decidability, and analysis
- Model checking workflow net based on Petri net
- Applications and Theory of Petri Nets 2004
Cited in
(16)- Structural soundness of workflow nets is decidable
- Sufficient and necessary condition to decide compatibility for a class of interorganizational workflow nets
- Diagnostic information for control-flow analysis of workflow graphs (a.k.a. free-choice workflow nets)
- Soundness of timed-arc workflow nets in discrete and continuous-time semantics
- Complexity of the soundness problem of bounded workflow nets
- Cost soundness for priced resource-constrained workflow nets
- Verifying generalized soundness of workflow nets
- Decidability of k-Soundness for Workflow Nets with an Unbounded Resource
- Soundness of workflow nets with reset ARCS
- On Determining the AND-OR Hierarchy in Workflow Nets
- PSPACE-completeness of the soundness problem of safe asymmetric-choice workflow nets
- Soundness of timed-arc workflow nets
- Soundness of workflow nets: classification, decidability, and analysis
- Safety and Soundness for Priced Resource-Constrained Workflow Nets
- Applications and Theory of Petri Nets 2004
- Applications and Theory of Petri Nets 2005
This page was built for publication: Complexity of the soundness problem of workflow nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5415301)
