Structural soundness of workflow nets is decidable

DOI10.1016/J.IPL.2005.06.002zbMath1184.68349OpenAlexW2106274692MaRDI QIDQ1044705

Ferucio Laurenţiu Ţiplea, Dan Cristian 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

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)

Related Items (3)

Decidability of $$k$$-Soundness for Workflow Nets with an Unbounded Resource ⋮ Sufficient and necessary condition to decide compatibility for a class of interorganizational workflow nets ⋮ Information flow analysis of scientific workflows

Cites Work

• Unnamed Item
• Unnamed Item
• Soundness and Separability of Workflow Nets in the Stepwise Refinement Approach
• Applications and Theory of Petri Nets 2004

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