Skip to main content

Table 7 The algorithm of GIT for discovering invisible task in non-free choice

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

  1. where:
  2. n: node of the graph database as activity
  3. a, b: other node in the model
  4. path: all path from b to a and connected by n on case[j]