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...
Saved in:
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!
|
Similar Items
-
On the Decidability of Soundness of Workflow Nets with an Unbounded Resource
by: V. A. Bashkin, et al.
Published: (2013-08-01) -
DETECTION OF DEADLOCKS IN PARALLEL PROGRAMS AS SOLUTION OF LINEAR DIOPHANTINE EQUATIONS
by: Olga F. Babakhyan
Published: (2011-08-01) -
ERROR HANDLING IN INTEGRATION WORKFLOWS
by: A. M. Nazarenko, et al.
Published: (2017-06-01) -
Modeling of parallel program synchronization primitives
by: Oleg S. Kryukov, et al.
Published: (2025-06-01) -
A Mathematical Model of Parallel Programs and an Approach Based on it to Verification of MPI Programs
by: Andrew M. Mironov
Published: (2021-12-01)