Computing the Concurrency Threshold of Sound Free-Choice Workflow Nets

被引:0
|
作者
Meyer, Philipp J. [1 ]
Esparza, Javier [1 ]
Voelzer, Hagen [2 ]
机构
[1] Tech Univ Munich, Munich, Germany
[2] IBM Res, Zurich, Switzerland
关键词
SCHEDULING PROBLEMS; CONTROL-FLOW; VERIFICATION; MINIMIZATION;
D O I
10.1007/978-3-319-89963-3_1
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Workflow graphs extend classical flow charts with concurrent fork and join nodes. They constitute the core of business processing languages such as BPMN or UML Activity Diagrams. The activities of a workflow graph are executed by humans or machines, generically called resources. If concurrent activities cannot be executed in parallel by lack of resources, the time needed to execute the workflow increases. We study the problem of computing the minimal number of resources necessary to fully exploit the concurrency of a given workflow, and execute it as fast as possible (i.e., as fast as with unlimited resources). We model this problem using free-choice Petri nets, which are known to be equivalent to workflow graphs. We analyze the computational complexity of two versions of the problem: computing the resource and concurrency thresholds. We use the results to design an algorithm to approximate the concurrency threshold, and evaluate it on a benchmark suite of 642 industrial examples. We show that it performs very well in practice: It always provides the exact value, and never takes more than 30 ms for any workflow, even for those with a huge number of reachable markings.
引用
收藏
页码:3 / 19
页数:17
相关论文
共 50 条
  • [1] Polynomial Time Verification of Reachability in Sound Extended Free-Choice Workflow Nets
    Yamaguchi, Shingo
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2014, E97A (02) : 468 - 475
  • [2] Discovering Sound Free-Choice Workflow Nets with Non-block Structures
    Huang, Tsung-Hao
    van der Aalst, Wil M. P.
    [J]. ENTERPRISE DESIGN, OPERATIONS, AND COMPUTING, EDOC 2022, 2022, 13585 : 200 - 216
  • [3] The relationship between workflow graphs and free-choice workflow nets
    Favre, Cedric
    Fahland, Dirk
    Voelzer, Hagen
    [J]. INFORMATION SYSTEMS, 2015, 47 : 197 - 219
  • [4] Polynomial Analysis Algorithms for Free-Choice Workflow Nets
    Esparza, Javier
    [J]. ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2017, (253): : 3 - 3
  • [5] Refactoring Problem of Acyclic Extended Free-Choice Workflow Nets to Acyclic Well-Structured Workflow Nets
    Yamaguchi, Shingo
    [J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2012, E95D (05): : 1375 - 1379
  • [6] Extremal throughputs in free-choice nets
    Bouillard, Anne
    Gaujal, Bruno
    Mairesse, Jean
    [J]. DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS, 2006, 16 (03): : 327 - 352
  • [7] Extremal Throughputs in Free-Choice Nets
    Anne Bouillard
    Bruno Gaujal
    Jean Mairesse
    [J]. Discrete Event Dynamic Systems, 2006, 16 : 327 - 352
  • [8] Extremal throughputs in free-choice nets
    Bouillard, A
    Gaujal, B
    Mairesse, J
    [J]. APPLICATIONS AND THEORY OF PETRI NETS 2005, PROCEEDINGS, 2005, 3536 : 108 - 127
  • [9] On Liveness of Non-Sound Acyclic Free Choice Workflow Nets
    Nakahara, Naoki
    Yamaguchi, Shingo
    [J]. 2014 SECOND INTERNATIONAL SYMPOSIUM ON COMPUTING AND NETWORKING (CANDAR), 2014, : 336 - 341
  • [10] Diagnostic Information for Control-Flow Analysis of Workflow Graphs (a.k.a. Free-Choice Workflow Nets)
    Favre, Cedric
    Voelzer, Hagen
    Mueller, Peter
    [J]. TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS (TACAS 2016), 2016, 9636 : 463 - 479