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
-
DETECTION OF DEADLOCKS IN PARALLEL PROGRAMS AS SOLUTION OF LINEAR DIOPHANTINE EQUATIONS
by: Olga F. Babakhyan
Published: (2011-08-01) -
Control-Flow-Based Methods to Support the Development of Sound Workflows
by: Thomas M. Prinz, et al.
Published: (2021-07-01) -
An improved Monte Carlo Tree Search approach to workflow scheduling
by: Hok-Leung Kung, et al.
Published: (2022-12-01) -
Integrated method for multi-UAV task assignment and trajectory planning with deadlock based on Three-dimensional dubins path
by: Weinan Wu, et al.
Published: (2025-07-01) -
Verification of systems with behavior parallelism on the basis of the graph of reachable states
by: Yu. V. Pottosin, et al.
Published: (2019-06-01)