Verifying generalized soundness of workflow nets
From MaRDI portal
(Redirected from Publication:3401950)
Recommendations
- Applications and Theory of Petri Nets 2004
- Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations
- Reduction of workflow nets for generalised soundness verification
- Soundness of workflow nets: classification, decidability, and analysis
- Complexity of the soundness problem of workflow nets
Cited in
(15)- Applications of polyhedral computations to the analysis and verification of hardware and software systems
- Soundness of timed-arc workflow nets in discrete and continuous-time semantics
- Reduction of workflow nets for generalised soundness verification
- Constraint Solving for Verifying Modal Specifications of Workflow Nets with Data
- Model checking workflow net based on Petri net
- Decidability of k-Soundness for Workflow Nets with an Unbounded Resource
- PSPACE-completeness of the soundness problem of safe asymmetric-choice 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
- Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations
- Fast termination and workflow nets
- The complexity of soundness in workflow nets
- Soundness of reset workflow nets
This page was built for publication: Verifying generalized soundness of workflow nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3401950)