Formalization of workflows and correctness issues in the presence of concurrency

被引:28
|
作者
Arpinar, IB [1 ]
Halici, U [1 ]
Arpinar, S [1 ]
Dogac, A [1 ]
机构
[1] Middle E Tech Univ, Dept Comp Sci, Software Res & Dev Ctr, TR-06531 Ankara, Turkey
关键词
workflow management system; workflow; activity; basic constraint; inter-activity constraint; time intervals; correctness; concurrency control;
D O I
10.1023/A:1008758612291
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, main components of a workflow system that are relevant to the correctness in the presence of concurrency are formalized based on set theory and graph theory. The formalization which constitutes the theoretical basis of the correctness criterion provided can be summarized as follows: Activities of a workflow are represented through a notation based on set theory to make it possible to formalize the conceptual grouping of activities. Control-flow is represented as a special graph based on this set definition, and it includes serial composition, parallel composition, conditional branching, and nesting of individual activities and conceptual activities themselves. Data-flow is represented as a directed acyclic graph in conformance with the control-flow graph. The formalization of correctness of concurrently executing workflow instances is based on this framework by defining two categories of constraints on the workflow environment with which the workflow instances and their activities interact. These categories are: Basic constraints that specify the correct states of a workflow environment. Inter-activity constraints that define the semantic dependencies among activities such as an activity requiring the validity of a constraint that is set or verified by a preceding activity. Basic constraints graph and inter-activity constraints graph which are in conformance with the control-flow and data-flow graphs are then defined to represent these constraints. These graphs are used in formalizing the intervals among activities where an inter-activity constraint should be maintained and the intervals where a basic constraint remains invalid. A correctness criterion is defined for an interleaved execution of workflow instances using the constraints graphs. A concurrency control mechanism, namely Constraint Based Concurrency Control technique is developed based on the correctness criterion. The performance analysis shows the superiority of the proposed technique. Other possible approaches to the problem are also presented.
引用
收藏
页码:199 / 248
页数:50
相关论文
共 50 条
  • [1] Formalization of Workflows and Correctness Issues in the Presence of Concurrency
    ÏsmaÏlcem Budak Arpinar
    UĞur Halici
    Sena Arpinar
    Asuman DoĞaÇ
    Distributed and Parallel Databases, 1999, 7 : 199 - 248
  • [2] A concurrency control algorithm for an open and safe nested transaction model: Formalization and correctness
    Madria, SK
    Maheshwari, SN
    Chandra, B
    JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 2003, 19 (02) : 283 - 328
  • [3] COMPOSITIONALITY, CONCURRENCY AND PARTIAL CORRECTNESS
    ZWIERS, J
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 321 : 1 - 272
  • [4] FORMALIZATION OF CORRECTNESS OF RECURSIVE DEFINITIONS
    CHEN, TY
    INTERNATIONAL JOURNAL OF COMPUTER & INFORMATION SCIENCES, 1980, 9 (01): : 55 - 61
  • [5] Concurrency and Asynchrony in Declarative Workflows
    Debois, Soren
    Hildebrandt, Thomas
    Slaats, Tijs
    BUSINESS PROCESS MANAGEMENT, BPM 2015, 2015, 9253 : 72 - 89
  • [6] Workflows with Passbacks and Incremental Verification of Their Correctness
    Takaki, Osamu
    Takeuti, Izumi
    Izumi, Noriaki
    Hasida, Koiti
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2012, E95D (04): : 989 - 1002
  • [7] Concurrency control algorithm for transactional workflows
    Li, H.C.
    Shi, M.L.
    Chen, X.X.
    Ruan Jian Xue Bao/Journal of Software, 2001, 12 (SUPPL.): : 1 - 9
  • [8] Development of the approach to check the correctness of workflows
    Afanasyev, Alexander
    Voit, Nikolay
    Ukhanova, Maria
    Ionova, Irina
    DATA SCIENCE AND KNOWLEDGE ENGINEERING FOR SENSING DECISION SUPPORT, 2018, 11 : 1392 - 1399
  • [9] CORRECTNESS AND FULL ABSTRACTION OF METRIC SEMANTICS FOR CONCURRENCY
    RUTTEN, JJMM
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 354 : 628 - 659
  • [10] Transactional TF: Transform Library with Concurrency and Correctness
    Ogiwara, Yushi
    Yorozu, Ayanori
    Ohya, Akihisa
    Kawashima, Hideyuki
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2023, E106D (12) : 1951 - 1959