Reduction rules for reset/inhibitor nets

DOI10.1016/j.jcss.2009.06.003zbMath1187.68330OpenAlexW2150970956WikidataQ57005388 ScholiaQ57005388MaRDI QIDQ847264

H. M. W. Verbeek, Wil M. P. van der Aalst, Arthur H. M. ter Hofstede, Moe Thandar Wynn

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

zbMATH Keywords

boundednesslivenessPetri netsreduction rulesinhibitor arcsreset arcs

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (4)

Discovery, Verification and Conformance of Workflows with Cancellation ⋮ Negotiation as concurrency primitive ⋮ Soundness of workflow nets: classification, decidability, and analysis ⋮ Connectivity of workflow nets: The foundations of stepwise verification

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Analysis issues in Petri nets with inhibitor arcs
• Reduction rules for time Petri nets
• Free Choice Petri Nets
• Reachability in Petri Nets with Inhibitor Arcs
• Lectures on Concurrency and Petri Nets
• Well-structured transition systems everywhere!

This page was built for publication: Reduction rules for reset/inhibitor nets