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 条
  • [11] Concurrency Optimized Task Scheduling for Workflows in Cloud
    Gao, Yihong
    Ma, Huadong
    Zhang, Haitao
    Kong, Xiangqi
    Wei, Wangyang
    2013 IEEE SIXTH INTERNATIONAL CONFERENCE ON CLOUD COMPUTING (CLOUD 2013), 2013, : 709 - 716
  • [12] Formalization and Verification of Behavioral Correctness of Dynamic Software Updates
    Zhang, Min
    Ogata, Kazuhiro
    Futatsugi, Kokichi
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2013, 294 : 12 - 23
  • [13] Runtime verification of concurrency-specific correctness criteria
    Shaz Qadeer
    Serdar Tasiran
    International Journal on Software Tools for Technology Transfer, 2012, 14 (3) : 291 - 305
  • [14] Correctness of concurrency based on semantic constraint resource workflow
    Hu, Nai-Jing
    Gu, Ning
    Shi, Bai-Le
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2003, 40 (05):
  • [15] Preserving the Correctness of Dynamic Workflows within a Cloud Environment
    Fakhfakh, Fairouz
    Kacem, Hatem Hadj
    Kacem, Ahmed Hadj
    Fakhfakh, Faten
    KNOWLEDGE-BASED AND INTELLIGENT INFORMATION & ENGINEERING SYSTEMS (KES-2018), 2018, 126 : 1541 - 1550
  • [16] REVERSE SERIALIZABILITY AS A CORRECTNESS CRITERION FOR OPTIMISTIC CONCURRENCY-CONTROL
    KWON, H
    MOON, S
    MICROPROCESSING AND MICROPROGRAMMING, 1994, 40 (10-12): : 759 - 762
  • [17] Accessing extra-database information: Concurrency control and correctness
    Gehani, N
    Ramamritham, K
    Shanmugasundaram, J
    Shmueli, O
    INFORMATION SYSTEMS, 1998, 23 (07) : 439 - 462
  • [18] SEPARATING POLICY FROM CORRECTNESS IN CONCURRENCY-CONTROL DESIGN
    ROBINSON, JT
    SOFTWARE-PRACTICE & EXPERIENCE, 1984, 14 (09): : 827 - 844
  • [19] On Correctness of Data Structures under Reads-Write Concurrency
    Lev-Ari, Kfir
    Chockler, Gregory
    Keidar, Idit
    DISTRIBUTED COMPUTING (DISC 2014), 2014, 8784 : 273 - 287
  • [20] Metamodel and Formalization to Model, Transform, Deploy, and Execute Quantum Workflows
    Beisel, Martin
    Barzen, Johanna
    Bechtold, Marvin
    Leymann, Frank
    Truger, Felix
    Weder, Benjamin
    CLOUD COMPUTING AND SERVICES SCIENCE, CLOSER 2022, CLOSER 2023, 2024, 1845 : 113 - 136