Resource-constrained workflow nets

zbMATH Open1095.68071MaRDI QIDQ5480657FDOQ5480657

Authors: K. M. van Hee, Natalia Sidorova, Marc Voorhoeve 

Publication date: 3 August 2006

Recommendations

• Applications and Theory of Petri Nets 2005
• Cost soundness for priced resource-constrained workflow nets
• Safety and Soundness for Priced Resource-Constrained Workflow Nets
• Decidability of $$k$$-Soundness for Workflow Nets with an Unbounded Resource
• Computing the concurrency threshold of sound free-choice workflow nets

zbMATH Keywords

verificationconcurrencyPetri netsresourcesworkflow

Mathematics Subject Classification ID

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

Cited In (11)

• Computing the concurrency threshold of sound free-choice workflow nets
• Safety and Soundness for Priced Resource-Constrained Workflow Nets
• Title not available (Why is that?)
• Process completing sequences for resource allocation systems with synchronization
• Model checking Petri nets with names using data-centric dynamic systems
• Constraint-Based Mining and Inductive Databases
• Applications and Theory of Petri Nets 2005
• Correctness Notions for Petri Nets with Identifiers
• Aligning event logs to resource-constrained \(\nu \)-Petri nets
• Cost soundness for priced resource-constrained workflow nets
• Exact and approximated log alignments for processes with inter-case dependencies

This page was built for publication: Resource-constrained workflow nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5480657)