Reduction rules for reset/inhibitor nets
From MaRDI portal
Publication:847264
DOI10.1016/J.JCSS.2009.06.003zbMATH Open1187.68330OpenAlexW2150970956WikidataQ57005388 ScholiaQ57005388MaRDI QIDQ847264FDOQ847264
Authors: H. M. W. Verbeek, Moe Thandar Wynn, W. M. P. van der Aalst, Arthur H. M. ter Hofstede 
Publication date: 12 February 2010
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2009.06.003
Recommendations
Cites Work
- Free Choice Petri Nets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Well-structured transition systems everywhere!
- Title not available (Why is that?)
- Analysis issues in Petri nets with inhibitor arcs
- Reachability in Petri Nets with Inhibitor Arcs
- Lectures on Concurrency and Petri Nets
- Reduction rules for time Petri nets
- Title not available (Why is that?)
- Monotonic extensions of Petri nets: forward and backward search revisited
- Title not available (Why is that?)
Cited In (6)
- On negotiation as concurrency primitive
- Soundness of workflow nets: classification, decidability, and analysis
- Soundness-preserving reduction rules for reset workflow nets
- Connectivity of workflow nets: The foundations of stepwise verification
- Discovery, Verification and Conformance of Workflows with Cancellation
- Transforming dynamic condition response graphs to safe Petri nets
This page was built for publication: Reduction rules for reset/inhibitor nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q847264)
