Soundness and separability of workflow nets in the stepwise refinement approach
From MaRDI portal
Recommendations
- Soundness of workflow nets: classification, decidability, and analysis
- Refinement of synchronizable places with multi-workflow nets. Weak termination preserved!
- Interacting workflow nets for workflow process re-engineering
- Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations
- Applications and Theory of Petri Nets 2005
Cited in
(17)- Structural soundness of workflow nets is decidable
- Sufficient conditions for the marked graph realisability of labelled transition systems
- Aligning event logs to resource-constrained \(\nu \)-Petri nets
- Data and process resonance. Identifier soundness for models of information systems
- Refinement of synchronizable places with multi-workflow nets. Weak termination preserved!
- Interacting workflow nets for workflow process re-engineering
- Discovery, Verification and Conformance of Workflows with Cancellation
- Compositional Service Trees
- On Determining the AND-OR Hierarchy in Workflow Nets
- Refinement of synchronizable places with multi-workflow nets
- Soundness of workflow nets: classification, decidability, and analysis
- Applications and Theory of Petri Nets 2004
- Correctness Notions for Petri Nets with Identifiers
- Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations
- Fast termination and workflow nets
- The complexity of soundness in workflow nets
- Connectivity of workflow nets: The foundations of stepwise verification
This page was built for publication: Soundness and separability of workflow nets in the stepwise refinement approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3550623)