Complexity of the soundness problem of bounded workflow nets
From MaRDI portal
Publication:2908201
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Theory of organizations, manpower planning in operations research (90B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
- Complexity of the soundness problem of workflow nets
- Soundness of workflow nets: classification, decidability, and analysis
- Soundness of timed-arc workflow nets in discrete and continuous-time semantics
- Applications and Theory of Petri Nets 2004
- PSPACE-completeness of the soundness problem of safe asymmetric-choice workflow nets
Cited in
(11)- PSPACE-completeness of the soundness problem of safe asymmetric-choice workflow nets
- Complexity of the soundness problem of workflow nets
- Applications and Theory of Petri Nets 2004
- Structural soundness of workflow nets is decidable
- Soundness of workflow nets with reset ARCS
- Soundness of workflow nets: classification, decidability, and analysis
- Decidability of $$k$$-Soundness for Workflow Nets with an Unbounded Resource
- Complexity of the deadlock problem for Petri nets modeling resource allocation systems
- Safety and Soundness for Priced Resource-Constrained Workflow Nets
- Interacting workflow nets for workflow process re-engineering
- Applications and Theory of Petri Nets 2005
This page was built for publication: Complexity of the soundness problem of bounded workflow nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2908201)
