Generalised soundness of workflow nets is decidable

DOI10.1007/978-3-540-27793-4_12MaRDI QIDQ5712330zbMATH OpenOpenAlexDBLPFDO

Authors K. M. van Hee, Natalia Sidorova, Marc Voorhoeve

Publication date 23 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b98283, https://research.tue.nl/en/publications/e947353a-1f46-43b2-a2de-fb396d3101f4

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Structural soundness of workflow nets is decidable
• Verifying generalized soundness of workflow nets
• Soundness of workflow nets: classification, decidability, and analysis
• Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations
• Complexity of the soundness problem of workflow nets
• Complexity of the soundness problem of bounded workflow nets
• Decidability of k-Soundness for Workflow Nets with an Unbounded Resource
• Soundness of resource-constrained workflow nets
• Reduction of workflow nets for generalised soundness verification
• Soundness and separability of workflow nets in the stepwise refinement approach

Cited in

(17)

• Soundness-preserving reduction rules for reset workflow nets
• Structural soundness of workflow nets is decidable
• Sufficient and necessary condition to decide compatibility for a class of interorganizational workflow nets
• An analytical method for well-formed workflow/Petri net verification of classical soundness
• Complexity of the soundness problem of bounded workflow nets
• Reduction of workflow nets for generalised soundness verification
• Refinement of synchronizable places with multi-workflow nets. Weak termination preserved!
• Verifying generalized soundness of workflow nets
• Decidability of k-Soundness for Workflow Nets with an Unbounded Resource
• Discovery, Verification and Conformance of Workflows with Cancellation
• PSPACE-completeness of the soundness problem of safe asymmetric-choice workflow nets
• Soundness of workflow nets: classification, decidability, and analysis
• Complexity of the soundness problem of workflow nets
• 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

Describes a project that uses

Uses Software

• Woflan

This page was built for publication: Generalised soundness of workflow nets is decidable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5712330)