Controllable Deadlocks in Parallel Resource-Constrained Workflows

We study the verification of the soundness property for workflow nets extended with resources. A workflow is sound if it terminates properly (no deadlocks and livelocks are possible). A class of resource-constrained workflow nets (RCWF-nets) is considered, where resources can be used by a process in...

Full description

Saved in:
Bibliographic Details
Main Authors: V. A. Bashkin, N. Yu. Panfilova
Format: Article
Language:English
Published: Yaroslavl State University 2014-12-01
Series:Моделирование и анализ информационных систем
Subjects:
Online Access:https://www.mais-journal.ru/jour/article/view/68
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We study the verification of the soundness property for workflow nets extended with resources. A workflow is sound if it terminates properly (no deadlocks and livelocks are possible). A class of resource-constrained workflow nets (RCWF-nets) is considered, where resources can be used by a process instance, but cannot be created or spent. Two sound RCWF-nets using the same set of resources can be put in parallel. This parallel composition may in some cases produce additional deadlocks. A problem of deadlock avoidance in parallel workflows is studied, some methods of deadlock search and control are presented.
ISSN:1818-1015
2313-5417