Soundness-preserving reduction rules for reset workflow nets
From MaRDI portal
Publication:1007883
Recommendations
Cites work
- scientific article; zbMATH DE number 4033100 (Why is no real title available?)
- scientific article; zbMATH DE number 1223710 (Why is no real title available?)
- scientific article; zbMATH DE number 1405652 (Why is no real title available?)
- scientific article; zbMATH DE number 1446377 (Why is no real title available?)
- Applications and Theory of Petri Nets 2004
- Free Choice Petri Nets
- Lectures on Concurrency and Petri Nets
- Lectures on Concurrency and Petri Nets
- Monotonic extensions of Petri nets: forward and backward search revisited
- Reduction rules for time Petri nets
- Well-structured transition systems everywhere!
Cited in
(9)- Discovery, Verification and Conformance of Workflows with Cancellation
- Connectivity of workflow nets: The foundations of stepwise verification
- Reduction of workflow nets for generalised soundness verification
- Research on workflow model based on Petri net with reset arcs
- Soundness of workflow nets: classification, decidability, and analysis
- Multiset topologies induced by multiset relations
- Reduction rules for reset/inhibitor nets
- Partial order reduction for checking soundness of time workflow nets
- Process mining with token carried data
This page was built for publication: Soundness-preserving reduction rules for reset workflow nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1007883)