Controllable Deadlocks in Parallel Resource-Constrained Workflows

• Published in: Modeling and Analysis of Information Systems
• Main Authors: V. A. Bashkin, N. Yu. Panfilova
• Format: Article in Journal/Newspaper
• Language: English; Russian
• Published: Yaroslavl State University 2014
• Subjects: потоки работ; ресурс; бездефектность; параллельная композиция; тупик; верификация; Information technology; T58.5-58.64; Тупик
• Online Access: https://doi.org/10.18255/1818-1015-2014-6-18-30; https://doaj.org/article/fd9a483b592747bc8e13d217c5b9515c

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.