Structural soundness of workflow nets is decidable

DOI10.1016/J.IPL.2005.06.002zbMATH Open1184.68349OpenAlexW2106274692MaRDI QIDQ1044705FDOQ1044705

Authors: Ferucio Laurenţiu Ţiplea, Dan C. Marinescu 

Publication date: 18 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.06.002

Recommendations

• Applications and Theory of Petri Nets 2004
• Complexity of the soundness problem of workflow nets
• Soundness of workflow nets: classification, decidability, and analysis
• Complexity of the soundness problem of bounded workflow nets
• Applications and Theory of Petri Nets 2005

zbMATH Keywords

algorithmsdecidabilityPetri netsoundnessworkflow net

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Soundness and separability of workflow nets in the stepwise refinement approach
• Applications and Theory of Petri Nets 2004

Cited In (9)

• Decidability of $$k$$-Soundness for Workflow Nets with an Unbounded Resource
• Applications and Theory of Petri Nets 2004
• Information flow analysis of scientific workflows
• Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations
• On Determining the AND-OR Hierarchy in Workflow Nets
• Soundness of workflow nets: classification, decidability, and analysis
• Applications and Theory of Petri Nets 2005
• Sufficient and necessary condition to decide compatibility for a class of interorganizational workflow nets
• The complexity of soundness in workflow nets

This page was built for publication: Structural 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 Q1044705)