Soundness of reset workflow nets
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1223710 (Why is no real title available?)
- scientific article; zbMATH DE number 2038739 (Why is no real title available?)
- scientific article; zbMATH DE number 7561336 (Why is no real title available?)
- A well-structured framework for analysing Petri net extensions
- Acyclic Petri and workflow nets with resets
- Applications and Theory of Petri Nets 2004
- Complexity hierarchies beyond elementary
- Discovery of cancellation regions within process mining techniques
- Hierarchies of number-theoretic functions. I
- Integer vector addition systems with states
- Language inclusion for boundedly-ambiguous vector addition systems is decidable
- On Petri nets with hierarchical special arcs
- Reachability in vector addition systems is Ackermann-complete
- Reachability in vector addition systems is primitive-recursive in fixed dimension
- Simulation problems over one-counter nets
- Soundness of workflow nets with reset ARCS
- Soundness of workflow nets: classification, decidability, and analysis
- Soundness-preserving reduction rules for reset workflow nets
- Structural soundness of workflow nets is decidable
- The complexity of soundness in workflow nets
- The ideal view on Rackoff's coverability technique
- The reachability problem for Petri nets is not primitive recursive
- Three Partition Refinement Algorithms
- Understanding Petri Nets
- Verification of workflow nets
- Verifying generalized soundness of workflow nets
- Well-structured transition systems everywhere!
This page was built for publication: Soundness of reset workflow nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6970267)
