Skip to main content

Table 5 The algorithm of GIT for invisible prime task discovery

From: Improving efficiency for discovering business processes containing invisible tasks in non-free choice

  1. where:
  2. x: node of graph database as invisible task
  3. [:SPLIT]: a split relation of activities (XORSplit, ORSplit or ANDSplit)
  4. [:JOIN]: a join relation of activities (XORJoin, ORJoin or ANDJoin)
  5. [:INVISIBLE]: a temporary relation to determine the need for invisible tasks
  6. size(): the number of occurrences of the specified relation in the graph database