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!
_version_ 1849240773240815616
author V. A. Bashkin
N. Yu. Panfilova
author_facet V. A. Bashkin
N. Yu. Panfilova
author_sort V. A. Bashkin
collection DOAJ
description 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.
format Article
id doaj-art-fd9a483b592747bc8e13d217c5b9515c
institution Kabale University
issn 1818-1015
2313-5417
language English
publishDate 2014-12-01
publisher Yaroslavl State University
record_format Article
series Моделирование и анализ информационных систем
spelling doaj-art-fd9a483b592747bc8e13d217c5b9515c2025-08-20T04:00:26ZengYaroslavl State UniversityМоделирование и анализ информационных систем1818-10152313-54172014-12-01216183010.18255/1818-1015-2014-6-18-3062Controllable Deadlocks in Parallel Resource-Constrained WorkflowsV. A. Bashkin0N. Yu. Panfilova1P.G. Demidov Yaroslavl State UniversityP.G. Demidov Yaroslavl State UniversityWe 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.https://www.mais-journal.ru/jour/article/view/68workflowresourcesoundnessparallel compositiondeadlockverification
spellingShingle V. A. Bashkin
N. Yu. Panfilova
Controllable Deadlocks in Parallel Resource-Constrained Workflows
Моделирование и анализ информационных систем
workflow
resource
soundness
parallel composition
deadlock
verification
title Controllable Deadlocks in Parallel Resource-Constrained Workflows
title_full Controllable Deadlocks in Parallel Resource-Constrained Workflows
title_fullStr Controllable Deadlocks in Parallel Resource-Constrained Workflows
title_full_unstemmed Controllable Deadlocks in Parallel Resource-Constrained Workflows
title_short Controllable Deadlocks in Parallel Resource-Constrained Workflows
title_sort controllable deadlocks in parallel resource constrained workflows
topic workflow
resource
soundness
parallel composition
deadlock
verification
url https://www.mais-journal.ru/jour/article/view/68
work_keys_str_mv AT vabashkin controllabledeadlocksinparallelresourceconstrainedworkflows
AT nyupanfilova controllabledeadlocksinparallelresourceconstrainedworkflows