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...
Main Authors: | V. A. Bashkin, N. Yu. Panfilova |
---|---|
Format: | Article |
Language: | English |
Published: |
Yaroslavl State University
2014-12-01
|
Series: | Modelirovanie i Analiz Informacionnyh Sistem |
Subjects: | |
Online Access: | https://www.mais-journal.ru/jour/article/view/68 |
Similar Items
-
On the Decidability of Soundness of Workflow Nets with an Unbounded Resource
by: V. A. Bashkin, et al.
Published: (2013-08-01) -
Deadlock-Guided Testing
by: Miguel Gomez-Zamalloa, et al.
Published: (2021-01-01) -
DETECTION OF DEADLOCKS IN PARALLEL PROGRAMS AS SOLUTION OF LINEAR DIOPHANTINE EQUATIONS
by: Olga F. Babakhyan
Published: (2018-07-01) -
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)