Verification of workflow nets with transition conditions

被引:7
作者
Wang, Zhao-xia [1 ,2 ,3 ,4 ,5 ]
Wang, Jian-min [1 ,3 ,4 ]
Zhu, Xiao-chen [1 ,2 ,3 ,4 ]
Wen, Li-jie [1 ,3 ,4 ]
机构
[1] Tsinghua Univ, Sch Software, Beijing 100084, Peoples R China
[2] Tsinghua Univ, Dept Comp Sci & Technol, Beijing 100084, Peoples R China
[3] Tsinghua Univ, MOE Key Lab Informat Syst Secur, Beijing 100084, Peoples R China
[4] Tsinghua Univ, Natl Lab Informat Sci & Technol, Beijing 100084, Peoples R China
[5] Logist Engn Univ, Dept Logist Informat & Engn, Chongqing 400016, Peoples R China
来源
JOURNAL OF ZHEJIANG UNIVERSITY-SCIENCE C-COMPUTERS & ELECTRONICS | 2012年 / 13卷 / 07期
基金
中国国家自然科学基金;
关键词
Workflow nets; Transition condition; Verification; Process model; PETRI NETS; ALGORITHMS;
D O I
10.1631/jzus.C1100364
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Workflow management is concerned with automated support for business processes. Workflow management systems are driven by process models specifying the tasks that need to be executed, the order in which they can be executed, which resources are authorised to perform which tasks, and data that is required for, and produced by, these tasks. As workflow instances may run over a sustained period of time, it is important that workflow specifications be checked before they are deployed. Workflow verification is usually concerned with control-flow dependencies only; however, transition conditions based on data may further restrict possible choices between tasks. In this paper we extend workflow nets where transitions have concrete conditions associated with them, called WTC-nets. We then demonstrate that we can determine which execution paths of a WTC-net that are possible according to the control-flow dependencies, are actually possible when considering the conditions based on data. Thus, we are able to more accurately determine at design time whether a workflow net with transition conditions is sound.
引用
收藏
页码:483 / 509
页数:27
相关论文
共 46 条
  • [1] [Anonymous], 2006, YICES SMT SOLVER
  • [2] [Anonymous], 1969, J COMPUT SYST SCI, DOI DOI 10.1016/S0022-0000(69)80011-5
  • [3] Clarke L. A., 1976, IEEE Transactions on Software Engineering, VSE-2, P215, DOI 10.1109/TSE.1976.233817
  • [4] CURRAN T, 1998, SAP R 3 BUSINESS BLU
  • [5] EFFICIENTLY COMPUTING STATIC SINGLE ASSIGNMENT FORM AND THE CONTROL DEPENDENCE GRAPH
    CYTRON, R
    FERRANTE, J
    ROSEN, BK
    WEGMAN, MN
    ZADECK, FK
    [J]. ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1991, 13 (04): : 451 - 490
  • [6] Bridging the gap between business models and workflow specifications
    Dehnert, J
    Van Der Aalst, WMP
    [J]. INTERNATIONAL JOURNAL OF COOPERATIVE INFORMATION SYSTEMS, 2004, 13 (03) : 289 - 332
  • [7] Dutertre B, 2006, LECT NOTES COMPUT SC, V4144, P81, DOI 10.1007/11817963_11
  • [8] Fan SK, 2007, LECT NOTES COMPUT SC, V4537, P433
  • [9] Typical case complexity of Satisfiability Algorithms and the threshold phenomenon
    Franco, J
    [J]. DISCRETE APPLIED MATHEMATICS, 2005, 153 (1-3) : 89 - 123
  • [10] DPLL(T):: Fast decision procedures
    Ganzinger, H
    Hagen, G
    Nieuwenhuis, R
    Oliveras, A
    Tinelli, C
    [J]. COMPUTER AIDED VERIFICATION, 2004, 3114 : 175 - 188