Soundness-preserving reduction rules for reset workflow nets
From MaRDI portal
Publication:1007883
DOI10.1016/J.INS.2008.10.033zbMATH Open1162.68488DBLPjournals/isci/WynnVAHE09OpenAlexW2137594927WikidataQ57005564 ScholiaQ57005564MaRDI QIDQ1007883FDOQ1007883
Authors: H. M. W. Verbeek, W. M. P. van der Aalst, Arthur H. M. ter Hofstede, Moe Thandar Wynn, David Edmond 
Publication date: 24 March 2009
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2008.10.033
Recommendations
Cites Work
- Free Choice Petri Nets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Well-structured transition systems everywhere!
- Lectures on Concurrency and Petri Nets
- Reduction rules for time Petri nets
- Applications and Theory of Petri Nets 2004
- Monotonic extensions of Petri nets: forward and backward search revisited
- Title not available (Why is that?)
- Lectures on Concurrency and Petri Nets
- Title not available (Why is that?)
Cited In (8)
- Reduction rules for reset/inhibitor nets
- Process mining with token carried data
- Reduction of Workflow Nets for Generalised Soundness Verification
- Soundness of workflow nets: classification, decidability, and analysis
- Multiset topologies induced by multiset relations
- Connectivity of workflow nets: The foundations of stepwise verification
- Discovery, Verification and Conformance of Workflows with Cancellation
- Partial order reduction for checking soundness of time workflow nets
Uses Software
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)
