The complexity of soundness in workflow nets
From MaRDI portal
Cites work
- A Bound on Solutions of Linear Integer Equalities and Inequalities
- 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
- Bedingt konvergente Reihen und konvexe Systeme. (Teil I.).
- Demystifying Reachability in Vector Addition Systems
- Free Choice Petri Nets
- scientific article; zbMATH DE number 3582425 (Why is no real title available?)
- scientific article; zbMATH DE number 1232238 (Why is no real title available?)
- scientific article; zbMATH DE number 1354143 (Why is no real title available?)
- scientific article; zbMATH DE number 1445908 (Why is no real title available?)
- Integer vector addition systems with states
- Modeling business processes. A Petri net-oriented approach
- Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma
- Soundness and separability of workflow nets in the stepwise refinement approach
- Soundness of workflow nets: classification, decidability, and analysis
- Structural soundness of workflow nets is decidable
- The complexity of the word problems for commutative semigroups and polynomial ideals
- The covering and boundedness problems for vector addition systems
- The Reachability Problem for Petri Nets Is Not Elementary
- The taming of the semi-linear set
- Verification of workflow nets
- Verifying generalized soundness 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)
