The complexity of soundness in workflow nets

DOI10.1145/3531130.3533341MaRDI QIDQ6649450

Philip Offtermatt, Filip Mazowiecki, Michael Blondin

Publication date: 6 December 2024

zbMATH Keywords

complexityPetri netssoundnessworkflow netsgeneralised soundnessstructural soundness

Mathematics Subject Classification ID

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?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Soundness of workflow nets: classification, decidability, and analysis
• Structural soundness of workflow nets is decidable
• The covering and boundedness problems for vector addition systems
• Bedingt konvergente Reihen und konvexe Systeme. (Teil I.).
• The complexity of the word problems for commutative semigroups and polynomial ideals
• Verifying Generalized Soundness of Workflow Nets
• Integer Vector Addition Systems with States
• Soundness and Separability of Workflow Nets in the Stepwise Refinement Approach
• A Bound on Solutions of Linear Integer Equalities and Inequalities
• The taming of the semi-linear set
• Demystifying Reachability in Vector Addition Systems
• Free Choice Petri Nets
• Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma
• The Reachability Problem for Petri Nets Is Not Elementary
• A Framework for Classical Petri Net Problems: Conservative Petri Nets as an Application
• Applications and Theory of Petri Nets 2004
• Applications and Theory of Petri Nets 2005
• Verification of workflow nets

This page was built for publication: The complexity of soundness in workflow nets

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