By Topic

Priority Workflow Nets

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Ferucio LaurenĊ£iu Tiplea ; Department of Computer Science, Alexandru Ioan Cuza University, Iaşi, Romania ; Corina Bocaneala

This paper proposes priority (resource-constrained) workflow nets (WF nets) as Petri-net-based models of (resource-constrained) workflows with priorities between tasks. It is shown that the soundness problem (behavioral correctness criterion) is undecidable for priority (resource-constrained) WF nets. If supplementary conditions are imposed, soundness for priority (resource-constrained) WF nets can be reduced to soundness for their underlying (resource-constrained) WF nets. Two such conditions are proposed in this paper. One of them generalizes the well-known EQUAL-conflict condition for priority Petri nets, and the other one generalizes the conflict-freeness condition for Petri nets. Using the Petri net path logic, it is shown that both conditions are decidable. Finally, a generalization of the priority relation is proposed, which allows for a broader spectrum of workflow modeling. The results aforementioned also hold in this case.

Published in:

IEEE Transactions on Systems, Man, and Cybernetics: Systems  (Volume:43 ,  Issue: 2 )