Soundness-preserving reduction rules for reset workflow nets

DOI10.1016/j.ins.2008.10.033zbMath1162.68488OpenAlexW2137594927WikidataQ57005564 ScholiaQ57005564MaRDI QIDQ1007883

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

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

zbMATH Keywords

soundnessreset netsworkflow verificationreduction rules

Mathematics Subject Classification ID

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

Related Items (6)

Reduction of Workflow Nets for Generalised Soundness Verification ⋮ Multiset topologies induced by multiset relations ⋮ Partial order reduction for checking soundness of time workflow nets ⋮ Process mining with token carried data ⋮ Soundness of workflow nets: classification, decidability, and analysis ⋮ Connectivity of workflow nets: The foundations of stepwise verification

Uses Software

• YAWL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reduction rules for time Petri nets
• Free Choice Petri Nets
• Lectures on Concurrency and Petri Nets
• Lectures on Concurrency and Petri Nets
• Applications and Theory of Petri Nets 2004
• Well-structured transition systems everywhere!

This page was built for publication: Soundness-preserving reduction rules for reset workflow nets